2024
A multipartite analogue of Dilworth's Theorem.
CoRR, 2024
2023
Hypergraph Ramsey numbers of cliques versus stars.
Random Struct. Algorithms, October, 2023
Three Early Problems on Size Ramsey Numbers.
Comb., August, 2023
Off-diagonal book Ramsey numbers.
Comb. Probab. Comput., May, 2023
Minimum degree and the graph removal lemma.
J. Graph Theory, April, 2023
Sunflowers in Set Systems of Bounded Dimension.
Comb., February, 2023
Making an H $H$ -free graph k $k$ -colorable.
J. Graph Theory, 2023
Threshold Ramsey multiplicity for paths and even cycles.
Eur. J. Comb., 2023
A structure theorem for pseudo-segments and its applications.
CoRR, 2023
Set-coloring Ramsey numbers and error-correcting codes near the zero-rate threshold.
CoRR, 2023
2022
Clique minors in graphs with a forbidden subgraph.
Random Struct. Algorithms, 2022
Multicolor list Ramsey numbers grow exponentially.
J. Graph Theory, 2022
Removal lemmas and approximate homomorphisms.
Comb. Probab. Comput., 2022
Extremal results on feedback arc sets in digraphs.
CoRR, 2022
Ramsey Numbers of Books and Quasirandomness.
Comb., 2022
Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022
2021
Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs.
SIAM J. Discret. Math., 2021
A Note on the Erdös Distinct Subset Sums Problem.
SIAM J. Discret. Math., 2021
On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices.
Random Struct. Algorithms, 2021
Sets without k-term progressions can have many shorter progressions.
Random Struct. Algorithms, 2021
Powers of paths in tournaments.
Comb. Probab. Comput., 2021
Making an $H$-Free Graph $k$-Colorable.
CoRR, 2021
Bounded VC-Dimension Implies the Schur-Erdős Conjecture.
Comb., 2021
On the Number of Edges of Separated Multigraphs.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021
2020
On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion.
SIAM J. Discret. Math., 2020
Books versus Triangles at the Extremal Density.
SIAM J. Discret. Math., 2020
Finding Cliques in Social Networks: A New Distribution-Free Model.
SIAM J. Comput., 2020
On edge-ordered Ramsey numbers.
Random Struct. Algorithms, 2020
Random Struct. Algorithms, 2020
Short proofs of some extremal results III.
Random Struct. Algorithms, 2020
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs.
J. Graph Theory, 2020
Towards the linear arboricity conjecture.
J. Comb. Theory, Ser. B, 2020
On Ramsey numbers of hedgehogs.
Comb. Probab. Comput., 2020
2019
A proof of Tomescu's graph coloring conjecture.
J. Comb. Theory, Ser. B, 2019
The removal lemma for tournaments.
J. Comb. Theory, Ser. B, 2019
Erdős-Hajnal Conjecture for Graphs with Bounded VC-Dimension.
Discret. Comput. Geom., 2019
Lines in Euclidean Ramsey Theory.
Discret. Comput. Geom., 2019
A fast new algorithm for weak graph regularity.
Comb. Probab. Comput., 2019
Induced arithmetic removal: complexity 1 patterns over finite fields.
CoRR, 2019
Approximating the rectilinear crossing number.
Comput. Geom., 2019
Towards Erdős-Hajnal for Graphs with No 5-Hole.
Comb., 2019
Semi-Algebraic Colorings of Complete Graphs.
Proceedings of the 35th International Symposium on Computational Geometry, 2019
2018
A polynomial bound for the arithmetic <i>k</i>-cycle removal lemma in vector spaces.
J. Comb. Theory, Ser. A, 2018
Fast Property Testing and Metrics for Permutations.
Comb. Probab. Comput., 2018
Erratum: On Regularity Lemmas and their Algorithmic Applications.
Comb. Probab. Comput., 2018
A completion of the proof of the Edge-statistics Conjecture.
CoRR, 2018
Erdős-Ginzburg-Ziv Constants by Avoiding Three-Term Arithmetic Progressions.
Electron. J. Comb., 2018
Ramsey-Turán Numbers for Semi-Algebraic Graphs.
Electron. J. Comb., 2018
More Distinct Distances Under Local Conditions.
Comb., 2018
2017
On the number of cliques in graphs with a forbidden minor.
J. Comb. Theory, Ser. B, 2017
J. Comb. Theory, Ser. B, 2017
On the Local Approach to Sidorenko's Conjecture.
Electron. Notes Discret. Math., 2017
On Regularity Lemmas and their Algorithmic Applications.
Comb. Probab. Comput., 2017
A tight lower bound for Szemerédi's regularity lemma.
Comb., 2017
Permutation Property Testing under Different Metrics with Low Query Complexity.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
A tight bound for Green's arithmetic triangle removal lemma in vector spaces.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
2016
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing.
SIAM J. Comput., 2016
On the minimum degree of minimal Ramsey graphs for multiple colours.
J. Comb. Theory, Ser. B, 2016
Short proofs of some extremal results II.
J. Comb. Theory, Ser. B, 2016
Ramsey numbers of cubes versus cliques.
Comb., 2016
Discrete Geometry, Algebra, and Combinatorics (Invited Talk).
Proceedings of the 32nd International Symposium on Computational Geometry, 2016
2015
SIAM J. Discret. Math., 2015
The Erdős-Hajnal conjecture for rainbow triangles.
J. Comb. Theory, Ser. B, 2015
Easily Testable Graph Properties.
Comb. Probab. Comput., 2015
A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing.
CoRR, 2015
The critical window for the classical Ramsey-Turán problem.
Comb., 2015
Density and regularity theorems for semi-algebraic hypergraphs.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Recent developments in graph Ramsey theory.
Proceedings of the Surveys in Combinatorics 2015, 2015
2014
Random Struct. Algorithms, 2014
What is Ramsey-equivalent to a clique?
J. Comb. Theory, Ser. B, 2014
Applications of a New Separator Theorem for String Graphs.
Comb. Probab. Comput., 2014
Short Proofs of Some Extremal Results.
Comb. Probab. Comput., 2014
On grids in topological graphs.
Comput. Geom., 2014
A minimum degree condition forcing complete graph immersion.
Comb., 2014
2013
The Number of Edges in k-Quasi-planar Graphs.
SIAM J. Discret. Math., 2013
Tournaments and colouring.
J. Comb. Theory, Ser. B, 2013
A note on light geometric graphs.
Discret. Math., 2013
An improved bound for the stepping-up lemma.
Discret. Appl. Math., 2013
Stanley-Wilf limits are typically exponential.
CoRR, 2013
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz.
Comb., 2013
Ramsey-type results for semi-algebraic relations.
Proceedings of the Symposium on Computational Geometry 2013, 2013
Proceedings of the Surveys in Combinatorics 2013, 2013
2012
Erdős-Hajnal-type theorems in hypergraphs.
J. Comb. Theory, Ser. B, 2012
Coloring K<sub>k</sub>-free intersection graphs of geometric objects in the plane.
Eur. J. Comb., 2012
Extremal results in sparse pseudorandom graphs
CoRR, 2012
On a problem of Erdös and Rothschild on edges in triangles.
Comb., 2012
On two problems in graph Ramsey theory.
Comb., 2012
String graphs and incomparability graphs.
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012
2011
Random Struct. Algorithms, 2011
Intersection patterns of curves.
J. Lond. Math. Soc., 2011
Two extensions of Ramsey's theorem
CoRR, 2011
Testing perfection is hard
CoRR, 2011
Constructing dense graphs with sublinear Hadwiger number
CoRR, 2011
Bounds for graph regularity and removal lemmas
CoRR, 2011
Computing the Independence Number of Intersection Graphs.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Overlap properties of geometric expanders.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
2010
Complete Minors and Independence Number.
SIAM J. Discret. Math., 2010
A bipartite strengthening of the Crossing Lemma.
J. Comb. Theory, Ser. B, 2010
Decompositions into Subgraphs of Small Diameter.
Comb. Probab. Comput., 2010
A Separator Theorem for String Graphs and its Applications.
Comb. Probab. Comput., 2010
Directed Graphs Without Short Cycles.
Comb. Probab. Comput., 2010
Maximum union-free subfamilies
CoRR, 2010
A new proof of the graph removal lemma
CoRR, 2010
Crossings between Curves with Many Tangencies.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010
2009
Ramsey numbers of sparse hypergraphs.
Random Struct. Algorithms, 2009
Large induced trees in K<sub>r</sub>-free graphs.
J. Comb. Theory, Ser. B, 2009
Two remarks on the Burr-Erdos conjecture.
Eur. J. Comb., 2009
A bipartite analogue of Dilworth's theorem for multiple partial orders.
Eur. J. Comb., 2009
Paths and Stability Number in Digraphs.
Electron. J. Comb., 2009
Crossings, Colorings, and Cliques.
Electron. J. Comb., 2009
Density theorems for bipartite graphs and related Ramsey-type results.
Comb., 2009
2008
Ramsey-Type Problem for an Almost Monochromatic K<sub>4</sub>.
SIAM J. Discret. Math., 2008
There exist graphs with super-exponential Ramsey multiplicity constant.
J. Graph Theory, 2008
On the decay of crossing numbers.
J. Comb. Theory, Ser. B, 2008
On a problem of Duke-Erdös-Rödl on cycle-connected subgraphs.
J. Comb. Theory, Ser. B, 2008
J. Comb. Theory, Ser. A, 2008
Rainbow solutions to the Sidon equation.
Discret. Math., 2008
Coloring <i>k<sub>k</sub></i>-free intersection graphs of geometric objects in the plane.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008
2007
The minimum degree of Ramsey-minimal graphs.
J. Graph Theory, 2007
An infinite color analogue of Rado's theorem.
J. Comb. Theory, Ser. A, 2007
Induced Ramsey-type theorems.
Electron. Notes Discret. Math., 2007
Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples.
Electron. Notes Discret. Math., 2007
2006
A Bipartite Analogue of Dilworth's Theorem.
Order, 2006
On Rado's Boundedness Conjecture.
J. Comb. Theory, Ser. A, 2006
2003
Rainbow Arithmetic Progressions and Anti-Ramsey Results.
Comb. Probab. Comput., 2003
