|![[Search]](/images/search.gif?1209136071)
|![[A-Z Index]](/images/az.gif?1209136071)
|![[Contact]](/images/contact.gif?1209136071)
||![[University of Birmingham]](/images/identifier2.gif?1243330508){kind=small} |
![[Talks@bham]](/images/talkslogosmall.gif?1243330508) |
Combinatorics and Probability seminar
Add to your list(s)
Send you e-mail reminders
Further detail
Weekly seminar on Combinatorics and Probability, which usually takes place on Thursday at 3pm. 0 upcoming talks and 162 talks in the archive. Covering real grids with multiplicity
Reconstructing 3D cube complexes from boundary distances
Maximum Coverage in Sublinear Space, Faster
Lower Bounds for Exact and Approximate k-Disjoint-Shortest-Paths
Perfect matchings in random sparsifications of Dirac hypergraphs
Monochromatic Sums and Products over the Rationals
Antidirected subgraphs of oriented graphs
Structured Decompositions: recursive data and recursive algorithms
Tight Lower Bounds for Parameterized Algorithms under ETH
Matroid valuations and where to see them
Counting vertices of integral polytopes defined by facets
Odd distances in colourings of the plane
Transversal cycle factors in multipartite graphs
Percolation in High-Dimensional Product Graphs
Discrete group actions on 3-manifolds and embeddable Cayley complexes
Turán densities for hypergraph with quasirandom links
Almost every matroid has a rank-3 wheel or rank-3 whirl as minor
Constructible graphs and the game of cops and robbers
Subgraphs in Semi-random Graphs (and Hypergraphs)
Rödl's theorem with restrictions
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number
Distinct degrees and homogeneous sets
How to build a pillar: a proof of Thomassen's conjecture
Dirac-type results for tilings and coverings in ordered graphs
Sufficient Conditions for Perfect Mixed Tilings
Towards a 1-dependent version of the Harris--Kesten theorem
Graph Decompositions
Tight Ramsey bounds for multiple copies of a graph
The n-queens problem
The Erdős-Rothschild problem
Degree conditions for spanning hypergraphs
Average degree and bicliques
Counting cliques in 1-planar graphs
Progress on the Kohayakawa-Kreuter conjecture
Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs
Open Problem Workshop, part 2
Counting complexity and quantum information theory
On embedding graphs in surfaces
Hypergraphs with many extremal configurations
A proof of the Erdős–Faber–Lovász conjecture
Counting integer partitions with the method of maximum entropy
Hypergraphs with many extremal configurations (cancelled)
Trees in Tournaments
Title to be confirmed
Finding Homeomorphs
Even-hole-free graphs with bounded degree have bounded treewidth
Counting solutions in the random k-SAT model
Large monochromatic tight cycles in 2-edge-coloured complete 4-uniform hypergraphs
Extremal stationary values for random digraphs
The threshold for the square of a Hamilton cycle
Combinatorial discrepancy and harmonic analysis
Algorithmic Aspects of The Lovász Local Lemma
Roots of random polynomials near the unit circle
Ryser's conjecture and more
On Hamilton cycles in highly symmetric graphs
Best Response Dynamics on Random Graphs
Combinatorial discrepancy and a problem of J.E. Littlewood on Flat Polynomials
A proof of Ringel's conjecture
Iterated product sets with shifts
Extremal problems of long cycles in random graphs
Counting Hamilton cycles in Dirac hypergraphs
The Typical Structure of Sets with Small Sumset
Homomorphisms from the torus
Sampling sufficiency for determining modularity.
Distinct degrees in induced subgraphs
The Erdős Sumset Conjecture
Nonlinear problems in arithmetic Ramsey theory
A degree sequence Komlós theorem
On the number of discrete chains in the plane
On the density of critical graphs without large cliques
Partial associativity in Latin squares
Path and cycle decompositions of dense graphs
The extremal number of subdivisions
Sharp thresholds for sparse functions with applications to extremal combinatorics
Spanning cycles in random directed graphs.
Dynamical Models of Random Simplicial Complexes
Tilings in randomly perturbed graphs: bridging the gap between Hajnal--Szemer\'edi and Johansson--Kahn--Vu
Sharp bounds for decomposing graphs into edges and triangles
Some open questions
Cycles of length three and four in tournaments
Stability results for graphs containing a critical edge
Parking on the integers
Rational Turan exponents
Counting hypergraph colorings in the local lemma regime
Colouring dense random graphs - when can we use the second moment method?
Highly linked tournaments
Resilient degree sequences with respect to Hamiltonicity in random graphs
Dynamic monopolies and degenerate sets
Counting delta-matroids
Branching Brownian motion with decay of mass
Analytic functions in Bernoulli percolation
Induced trees and Erdos-Hajnal
An isoperimetric approach to some Erdos-Ko-Rado type problems
Scaling limits of Markov Branching Trees
Online graph coloring with bichromatic exchanges
Colouring triangle-free graphs with few colours
The Junta Method for Hypergraphs
Edge correlations in random regular hypergraphs
Shotgun Assembly of the Hypercube
The size of the giant component in random hypergraphs: a short proof
A bandwidth theorem for approximate decompositions
The minimum number of triangles in a graph of given order and size
Scaling limits of critical inhomogeneous random graphs
Rainbow spanning subgraphs of graphs with large minimum degree
Bounding the cop-number of a graph in terms of its genus
A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
Self-avoiding walk in ∞ + 1 dimensions
The trophic structure of directed graphs
Intersecting families
Two problems in extremal graph theory
Measure-valued Pólya processes
Exploiting structure in sets of frequencies
Correspondence Coloring and its Applications
Extremal Cuts and Isoperimetry in Random Cubic Graphs
On some recent applications of the polynomial method
Contagious sets in a degree-proportional bootstrap percolation process
Exceptional times of the critical Erdős-Rényi graph
On the List Coloring Version of Reed's Conjecture
Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of n-leaf Galton-Watson trees
Conjectures in spectral graph theory
Inversions in random node labeling of random trees
Domination in structured tournaments
Degree versions of some classical results in Extremal Combinatorics
Covering and tiling hypergraphs with tight cycles
Edges not in any monochromatic copy of a fixed graph
Monochromatic Cycle Partitioning
Branchings in Digraphs: Structural Results and Algorithms
Mathematics Colloquium: Containers in Combinatorics
Galton-Watson trees and Apollonian networks
Homological connectivity of random hypergraphs
Generalised Colouring Numbers of Graphs
Minimum number of edges that occur in odd cycles
Counting extensions in random graphs
Large deviations in random graphs
Forbidden vector-valued intersections
Finite reflection groups and graph norms
Random walk on dynamical percolation
Computability and Finite Forcibility of Graph Limits
Hereditary quasirandomness without regularity
Scaling limits of critical random trees and graphs.
Subdivisions in C_4-free graphs.
On the number of cycles covering distinct vertex sets.
If you have a question about this list, please contact: Dr Andrew Treglown; Allan Lo; Richard Montgomery; Johannes Carmesin; Eoin Long; M.Jenssen; David Craven; Dr Richard Mycroft. If you have a question about a specific talk, click on that talk to find its organiser. |
Other listsAlgebra Reading Group on Sporadic Groups Computer Science Departmental Series Mathematics ColloquiumOther talksProvably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Topological magnons and quantum magnetism The percolating cluster is invisible to image recognition with deep learning Signatures of structural criticality and universality in the cellular anatomy of the brain Many-body localization from Hilbert- and real-space points of view [Friday seminar]: Irradiated brown dwarfs in the desert |
Simona Boyadzhiyska, Birmingham.
Thursday 18 May 2023, 15:00-16:00