|![[Search]](http://talks.cam.ac.uk/images/search.gif?1209136071)
|![[A-Z Index]](http://talks.cam.ac.uk/images/az.gif?1209136071)
|![[Contact]](http://talks.cam.ac.uk/images/contact.gif?1209136071)
||![[University of Cambridge]](http://talks.cam.ac.uk/images/identifier2.gif?1209136071){kind=small} |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![[Talks.cam]](http://talks.cam.ac.uk/images/talkslogosmall.gif?1209136071) |
Combinatorics Seminar
Add to your list(s)
Send you e-mail reminders
Further detail
The Combinatorics Seminar normally meets at 2.30pm on Thursdays in Room MR12 , CMS. For further information contact Imre Leader or Andrew Thomason. These seminars appear also on the Combinatorics Seminar page of the DPMMS web site. If you have a question about this list, please contact: HoD Secretary, DPMMS; ibl10; jayne Clough. If you have a question about a specific talk, click on that talk to find its organiser. 0 upcoming talks and 320 talks in the archive. Product-mixing in compact Lie groups
Waring's problem with restricted digits.
Matchings and Loose Cycles in the Semirandom Hypergraph Model
Infinite monochromatic exponential patterns
A Ramsey Characterisation of Eventually Perioidic Words
Paradoxical Decompositions and Colouring Rules
Paradoxical Decompositions and Colouring Rules
The trace reconstruction problem
The trace reconstruction problem
Spanning trees in pseudorandom graphs via sorting networks
On the evolution of structure in triangle-free graphs
Recent progress on the hard sphere model
Monochromatic Sums and Products over the Rationals
Improved lower bounds for Szemeredi’s theorem.
Improved lower bounds for Szemeredi’s theorem.
Pancyclicity of highly connected graphs
Sharp stability for the Brunn-Minkowski inequality for arbitrary setsNote unusual room
Sharp stability for the Brunn-Minkowski inequality for arbitrary setsNote unusual room
Sharp stability for the Brunn-Minkowski inequality for arbitrary setsNote unusual room
Counting graphic sequencesNote 2pm start
Counting graphic sequencesNote 2pm start
On an old problem of Erdős
On an old problem of Erdős
Some combinatorial applications of guided random processes
Some combinatorial applications of guided random processes
Spanning regular subgraphs of random graphs: sharp thresholds
New bounds towards the Erdős-Gallai cycle decomposition conjectureNote this seminar will start at 15:15
K_r-saturated graphs with large minimum degree
K_r-saturated graphs with large minimum degree
Generating random regular graphs quickly.
Odd distances in colourings of the plane
Forcing quasirandomness in graphs
Induced subgraphs of induced subgraphs of large chromatic number
The total domination game and the 3/4 Conjecture
Small subgraphs with large average degree
Anticoncentration in Ramsey graphs and a proof of the Erdos-McKay conjecture
Small subgraphs with large average degree
Monochromatic products and sums in N and Q
Monochromatic products and sums in N and Q
Distinct degrees and homogeneous sets
Divisor distribution of random integers.
The singularity probability of a random symmetric matrix is exponentially small
Transversals in quasirandom latin squares
An asymptotic minors property for ranks of higher-dimensional tensors
Testability of relations between permutations
Effective results on the size and structure of sumsets
Ramsey theory on homogeneous structures
configurations containing 4-term arithmetic progressions are uncommon
Minimum degree stability and locally colourable graphs
Large hypergraphs without tight cycles
** POSTPONED ** Linear configurations containing 4-term arithmetic progressions are uncommonThis talk is postponed until Thursday 10th February
The dimension of the divisibility order
Infinitely Edge-Connected Graphs
Anti-concentration of Rademacher sums
Anti-concentration of Rademacher sums
Counting Hamiltonian cycles in Dirac hypergraphs
Sparse minors in graphs
Rank-Based Independence Testing in Near Linear Time
Hamilton cycles in highly symmetric graphs
Dense induced bipartite subgraphs in triangle-free graphs
Graphs with forbidden induced subgraphs
Inequalities on projected volumes
Stable isoperimetry in lattice-like graphs
Halfway to Rota's basis conjecture
Generalised Knight Tours
An approximate version of Jackson's conjecture
Intersection sizes of linear subspaces with the hypercube
The (non-)concentration of the chromatic number
Planar graphs: One graph to rule them all
Cyclically Covering Subspaces in F 2 to the n
Degree conditions forcing oriented cycles
Monochromatic tight cycle partition for 3-graphs
Successive shortest paths
The graph Moran process
The Graham-Pollak Problem for Hypergraphs
A stable arithmetic regularity lemma in finite abelian groups
Cycle-complete Ramsey numbers
Analytic functions in Bernoulli percolation
The number of symbols that forces a transversal
Colouring the real numbers and sum-sets with repetitions
Families of permutations with a forbidden intersection
Stability results for graphs containing a critical edge
The largest K_s-free induced subgraph in a K_t-free graph
Nonstandard Methods in Ramsey Theory
Theorems of Caratheodory, Helly, and Tverberg without dimension
The Junta Method for Hypergraphs
Complete Graphs with No Rainbow Tree
Sets of integers with many solutions to a linear equation
Minimum saturated families of sets
Cross-intersecting families
Graphons and Graphexes as Limits of Sparse Graphs: Part II
Graphons and Graphexes as Limits of Sparse Graphs: Part I
Polynomial configurations in sets of positive upper density
Generalized sum-product phenomenon and group configurations
Hypergraph Saturation Irregularities
Borel Local Lemma
Hamilton spheres in 3-uniform hypergraphs
How many irreducible polynomials are there with 0-1 coefficients?
Maximising the number of induced cycles
Isoperimetry in integer lattices
Fractional decompositions of dense graphs
Embedding simply connected 2-complexes in 3-space
Long cycles in hamiltonian graphs
The Multicolour Ramsey Number of a Long Odd Cycle
On the chromatic number of a sparse random hypergraph
Elusive problems in extremal graph theory
Minimising the Number of Triangles
List colourings and preference orders
Tangles and the Mona Lisa
Ramsey problems in directed graphs
Counting problems in additive combinatorics
Families with few k-chains
Highly connected subgraphs in sparse graphs
Monochromatic Infinite Sumsets
Forbidden vector-valued intersections
Tight Hamilton Cycles in 3-Graphs
Induced Subgraphs of Ramsey Graphs
Finite reflection groups and graph norms
Essential Expansion is Forceable
Decomposing Complete Hypergraphs
Increasing Sequences of Integer Triples
Symmetric Intersecting Families of Sets
Induced subgraphs of graphs with large chromatic number
A Stability Theorem for Maximal K_{r+1}-free graphs
Sparse graph convergence and where it goes
Limits of some combinatorial problems
Polychromatic colouring and cover-decomposition problems in the plane
Extremal problems for cycles in graphs
Exponential Patterns in Arithmetic Ramsey Theory
Noise sensitivity in bootstrap percolation
The Chromatic Number of Dense Random Graphs
Clique colourings of random graphs
Product mixing and product-free sets in the alternating group
Transitive Avoidance Games
Achlioptas processes and truncated stochastic coalescence
The sharp threshold for making squares
Matchings in random bipartite graphs
Additive triples of permutations
The multiplication table problem for bipartite graphs
Cutoff on all Ramanujan Graphs
Measurable circle squaring
A Concentration Inequality for Product Spaces
Edge-decompositions of graphs with high minimum degree
Tree-Decompositions of Infinite Graphs
Quantitative quasirandomness
Connectivity in graph classes
Bootstrap Percolation in the Hypercube
Clustering in preferential attachment networks
A stability theorem for approximate representations
Ramanujan Graphs and Finite Free Convolutions of Polynomials
A fat Szemerédi-Trotter theorem, and Inverse 2D Kakeya theorems
Searching for hidden moving targets on graphs
Forbidden submatrices and forbidden subposets
Edge-Decompositions of Graphs
Birthday Inequalities, Hard Spheres, and Independent Sets
Points in Almost General Position
Monochromatic cycle partitions
Rigorous Analysis of a Randomised Number Field Sieve
Maximal clades in random binary search trees
Decomposition of multiple coverings of the plane
The Ramsey Theory of Ordinals
Cycles in Oriented 3-Graphs
Tiling the Grid
Colouring graphs with no odd holes
Coalescence on the Real Line
The number of maximal sum-free subsets of integers
Balls-into-Bins via Local Search
Fast wins in n-in-a-row games
Random graphs on the hyperbolic plane
On Graphs Defined by Some Systems of Equations
Universality for critical cellular automata in d dimensions
Embedding spanning structures in random and pseudorandom graphs
A problem of Erdos and Sos on 3-graphs
The Existence of Designs
The Chromatic Number of Random Hypergraphs
The Method of Typical Bounded Differences
Random Subgraphs of some Distance Graphs
Random Subgraphs of some Distance Graphs
Disjoint Subgraphs of the Same Size
Exactly m-Coloured Graphs
Local Maxima of Quadratic Boolean Functions
The Ramsey Number of the Clique and the Hypercube
Frankl-Rodl-Type Theorems for Codes and Permutations
The minimum modulus of a covering system is at most 10^19
Forbidden submatrices
Bounded gaps between primes: The latest developments from a combinatorial perspective
Decomposing the cube into paths
Orientations of Hypergraphs and Sparse Ramsey Theory
Discrete Riemann mapping and the Poisson boundary
Small minors and subdivisions
Sets of integers with no large sum-free subset
Hitting Times for Maker-Breaker Games
Juntas, stability and isoperimetric inequalities in the symmetric group
Partition Regularity in the Rationals
Polynomial-time perfect matchings in dense hypergraphs
Limits of Permutations: Forcing and Testing
Proof of the 1-factorization and Hamilton decomposition conjectures
The Size of Capsets
A measurable version of the Lovász Local Lemma
Local algorithms on bounded degree graphs
Partition Regularity in the Rationals (POSTPONED)
Expansion in the group of affine transformations
Random graphs from a minor-closed class
Point-Line Problems
How many real roots does a random matrix have?
Partitioning coloured graphs into monochromatic cycles
Tiling Euclidean Space with Multiplicity by a Polytope
The phase transition in random graphs -- a simple proof
The Speed of Bootstrap Percolation
Extremal graphs and graph limits
Large and Judicious Bisections of Graphs
Hamilton Cycles in Random Cayley Graphs
Possible Turán Densities
Explosive Percolation is Continuous
Maximal percolation time in bootstrap percolation
Bootstrap percolation with recovery
Analytical and Combinatorial Problems via Probability
Solving S-Unit Equations
Tensors, colours, and octahedra
Euclidean Ramsey Theory
Two Erdős problems on lacunary sequences: chromatic number and Diophantine approximation
Independent sets in hypergraphs
Hypergraph containers and list colourings
Well-quasi-ordering binary matroids (Aitken Lecture)
Convex chains among random points in the plane
Random Sorting Networks
Belief propagation guided decimation for random k-SAT
Random Records and Cuttings in Split Trees
New Bounds for the hard-core model on the square lattice
Sets without arithmetic progressions, and patterns in arithmetic progressions
Counterexamples to the Hirsch Conjecture
Judicious partitions of hypergraphs
Convexity Spaces and Extremal Set Theory
Triangle-Intersecting Families of Graphs
An Approximate Form of Sidorenko's Conjecture
On sumsets of convex sets
Matchings and packings in graphs, k-graphs and k-systems
Codegree problems for 3-graphs
Probably intersecting families
Concrete Mathematical Incompleteness
Hurricane Andrew strikes again
Graphs as Electrical Networks
Every Prime Number has Property B
Recent results on the edit distance of graphs
Morphisms for Combinatorial Optimization
The density Hales-Jewett theorem (Part III)
The density Hales-Jewett theorem (Part 2)
The density Hales-Jewett theorem (Part 1)
On 3N colored points in a plane
Hypergraphs do jump
Long paths in subgraphs of the cube
Bootstrap percolation in two dimensions: recent progress and open problems
Analysing card shuffling via coupling
Expanders, Ramanujan graphs and random lifts
Graph limits for threshold graphs and interval graphs
Random partial orders and random linear extensions
A Sparse Regularity Lemma
Establishing Complexity of Problems Parameterized Above Average
Newton's Method for Finding Roots of Complex Polynomials: Complex Dynamics Between Combinatorics and Numerical Analysis
Directed Simplices in Higher Order Tournaments
The maximal probability that k-wise independent bits are all 1
Colliding Permutations
Lion and Man -- Can Both Win?
Strictly monotonic sequences in R^n
Approaching Kelly's Conjecture
Tiling with Triangles
Shadows and intersections: stability and new proofs
The structure of almost every graph in a hereditary property
How to choose the best twins
Multigraphs with two weighted colours
Economical elimination of cycles in the torus
Unfriendly Partitions
Random matrices: Universality of ESDs and the circular law
Differentiability in Null Sets
Expander graphs based on GRH and some cryptographic applications
Combinatorial theorems in sparse random sets
A short story on summability, ideals, and stable Kneser hypergraphs
The number of triangles in a graph
Intersecting Families of Permutations
Cycles in Oriented Graphs
Laplacians, homology and hypergraph matching
Multivariate Pólya-Schur theory and applications
A Quadratic Bound for Subset Sums
Graphs in locally 2-connected spaces
On the existence of certain generalized quadrangles
Inapproximability of the Tutte polynomial
Avoiding small subgraphs in Achlioptas processes
Cores, hulls and synchronization
The combinatorics of moment calculationsnon-standard day and time
Generalizations of the Heilmann-Lieb Theorem -- with Proofs
A hypergraph regularity method for generalised Turán problems
Sampling convex bodies and random matrix theoryCombinatorics Seminar
Please see above for contact details for this list. |
Other listsGraduate Seminars PhD Colloquium - Dept of Architecture Chi Han WorkshopOther talksFumarate hydratase and renal cancer: oncometabolites and beyond ADMM for Exploiting Structure in MPC Problems Surrogate models in Bayesian Inverse Problems "Itsa me! Luigi!" [citation needed] - unlocking your referencing skills Prof Kate Jones (UCL): Biodiversity & Conservation Speak white, speak black, speak American Existence of Lefschetz fibrations on Stein/Weinstein domains Fields of definition of Fukaya categories of Calabi-Yau hypersurfaces The evolution of photosynthetic efficiency The Rise of Augmented Intelligence in Edge Networks A Bourdiesian analysis of songwriting habitus |
David Ellis (Bristol).
Thursday 14 March 2024, 14:30-15:30