Name:
Affiliation:
E-mail:	(only provided to users who are logged into talks.cam)
Last login:	6 Nov 2024, 11:04 p.m.

Public lists managed by

• Combinatorics Seminar

Talks given by

Obviously this only lists talks that are listed through talks.cam. Furthermore, this facility only works if the speaker's e-mail was specified in a talk. Most talks have not done this.

Talks organised by

This list is based on what was entered into the 'organiser' field in a talk. It may not mean that actually organised the talk, they may have been responsible only for entering the talk into the talks.cam system.

• Constructions of Turán systems that are tight up to a multiplicative constant
• Group-harmonious labellings of trees
• Sums of algebraic dilates
• Sums of algebraic dilates
• The diameter of somewhat dense Cayley graphs on $A_n$
• Lower bounds for van der Waerden numbers
• On Graham's rearrangement conjecture
• Counting cycles in planar graphs
• Infinite families of diameter-2 graphs with no triangle or K_2,t.
• Large Sum-free sets via L^1-estimates
• The Multicolour Size Ramsey Number of a Path
• Euclidean Ramsey sets and the block sets conjecture
• The Ramsey numbers R(3,k)
• The Ramsey numbers R(3,k)
• Powers of 2 in high-dimensional lattice walks
• Powers of 2 in high-dimensional lattice walks
• Modular Graph Colourings
• Modular Graph Colourings
• Lonely runners and their spectra
• Lonely runners and their spectra
• A resolution of the Aharoni--Korman conjecture
• Independent spanning trees in the hypercube
• Finding a solution to the Erdős-Ginzburg-Ziv theorem
• Finding a solution to the Erdős-Ginzburg-Ziv theorem
• Multiply Intersecting Families.
• The rainbow saturation number
• The rainbow saturation number
• A Covering Pursuit Game
• A Covering Pursuit Game
• A Covering Pursuit Game
• Monotone arrays and a multidimensional Ramsey Theorem
• How to win an election using Kneser Graph colourings
• How to win an election using Kneser Graph colourings
• Some problems in coarse graph theory
• A new algebraic approach to the wreath conjecture
• A new algebraic approach to the wreath conjecture
• Decomposing Latin squares into transversals.
• Expander graphs from Cayley graphs of groups where every generating set works
• Expander graphs from Cayley graphs of groups where every generating set works
• Large transversals in Equi-n-squares
• Large transversals in Equi-n-squares
• Durer and his mathematics
• Reconstructing a large subset of a point set in R from random sparse distance information
• Layered subgraphs of the hypercube
• Layered subgraphs of the hypercube
• Optimally packing Hamilton cycles in random digraphs
• The structure of subset sums in higher dimensions
• The number of monochromatic solutions to multiplicative equations
• A geometric approach to Ramsey numbers
• Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees.
• Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees.
• Percolation through isoperimetry
• Graphs forced by rainbow stars
• Tight anti-concentration of Rademacher sums
• Universality for bootstrap percolation
• Product-mixing in compact Lie groups
• The Wiener-Pitt phenomenon
• Matchings and Loose Cycles in the Semirandom Hypergraph Model
• Kneser graphs are Hamiltonian
• 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
• 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 sets
• Sharp stability for the Brunn-Minkowski inequality for arbitrary sets
• Sharp stability for the Brunn-Minkowski inequality for arbitrary sets
• Partial shuffles by lazy swaps
• 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
• Constructible graphs and pursuit
• Constructible graphs and pursuit
• New bounds towards the Erdős-Gallai cycle decomposition conjecture
• 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
• Keisler's order is not simple
• 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
• Linear configurations containing 4-term arithmetic progressions are uncommon
• Large hypergraphs without tight cycles
• Counting Hamiltonian cycles in Dirac hypergraphs