|
Andrew Thomason
Click here to return to the page you were on when you logged in.
Name: | Andrew Thomason |
Affiliation: | University of Cambridge |
E-mail: | (only provided to users who are logged into talks.cam) |
Last login: | Wed Oct 20 16:34:59 +0000 2021 |
Public lists managed by Andrew Thomason
Talks given by Andrew Thomason
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 Andrew Thomason
This list is based on what was entered into the 'organiser' field in a talk. It may not mean that Andrew Thomason actually organised the talk, they may have been responsible only for entering the talk into the talks.cam system.
- 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
- Cyclically Covering Subspaces in F 2 to the n
- Degree conditions forcing oriented cycles
- Monochromatic tight cycle partition for 3-graphs
- Successive shortest paths
- Coordinate Deletion
- 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
- Voronoi Games in the Hypercube
- 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
- Multicolour Ramsey Numbers of Odd Cycles
- 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
- Induced posets
- 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
- 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 minimum modulus of a covering system is at most 10^19
- Forbidden submatrices
- Bounded gaps between primes: The latest developments from a combinatorial perspective
- Cycle packing
- 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
- Tilted Sperner Families
- Hitting Times for Maker-Breaker Games
- Optimal Resistor Networks
- 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
- Matching Numbers of Hypergraphs
- Large and Judicious Bisections of Graphs
- Hamilton Cycles in Random Cayley Graphs
- Two Extensions of Ramsey's Theorem
- The chromatic thresholds of 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
- Ramsey goodness
- 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
- Linus sequences
- 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
- Title to be confirmed
- 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
- Title to be confirmed
- 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
- Generalizations of the Heilmann-Lieb Theorem -- with Proofs
- Sparse Ramsey Theory
|