Interview with David Conlon
From MaRDI portal
Cites work
- A combinatorial problem in geometry.
- A correlation inequality for bipartite graphs
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- A new upper bound for diagonal Ramsey numbers
- A relative Szemerédi theorem
- An approximate version of Sidorenko's conjecture
- An upper bound for some ramsey numbers
- Bipartite subgraphs and quasi-randomness
- Bounds on equiangular lines and on related spherical codes
- Combinatorial theorems in sparse random sets
- Combinatorial theorems relative to a random set
- Dependent random choice
- Diagonal Ramsey via effective quasirandomness
- Equiangular lines and spherical codes in Euclidean space
- Equiangular lines with a fixed angle
- Euclidean Ramsey theorems. I
- Extremal results for random discrete structures
- Graphs with few paths of prescribed length between any two vertices
- scientific article; zbMATH DE number 4029619 (Why is no real title available?)
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- Many Turán exponents via subdivisions
- On sets of integers containing k elements in arithmetic progression
- On size Ramsey numbers of graphs with bounded degree
- On-line Ramsey Numbers
- Online Ramsey numbers and the subgraph query problem
- Ramsey games near the critical threshold
- Random algebraic construction of extremal graphs
- Rational exponents in extremal graph theory
- Sidorenko's conjecture for blow-ups
- Some advances on Sidorenko's conjecture
- Sparse partition universal graphs for graphs of bounded degree
- The Green-Tao theorem: an exposition
- The Ramsey number of books
- The regularity method for graphs with few 4‐cycles
- The size Ramsey number
- The size‐Ramsey number of cubic graphs
- Threshold Functions for Ramsey Properties
- Transitive sets in Euclidean Ramsey theory
This page was built for publication: Interview with David Conlon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659985)
