Jacob Fox

Huy Tuan Pham

Order, April, 2026

Separators for intersection graphs of spheres.

[BibT_eX]

[DOI]

Jonathan Tidor

CoRR, March, 2026

Triangle Ramsey numbers of complete graphs.

[BibT_eX]

[DOI]

Jonathan Tidor

Shengtong Zhang

J. Comb. Theory B, 2026

Big line or big convex polygon.

[BibT_eX]

[DOI]

Comput. Geom., 2026

Finer Control on Relative Sizes of Iterated Sumsets.

[BibT_eX]

[DOI]

Noah Kravitz

Shengtong Zhang

Electron. J. Comb., 2026

2025

The Largest Subgraph Without A Forbidden Induced Subgraph.

[BibT_eX]

[DOI]

Rajko Nenadov

Huy Tuan Pham

Comb., December, 2025

A structure theorem for pseudosegments and its applications.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2025

Induced subgraph density. II. Sparse and dense sets in cographs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2025

A Note on Directed Analogues of the Sidorenko and Forcing Conjectures.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

From Local Pair-Crossing Number to Local Crossing Number.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Graph Drawing and Network Visualization, 2025

Immersions and Albertson's Conjecture.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

On random irregular subgraphs.

[BibT_eX]

[DOI]

Sammy Luo

Huy Tuan Pham

Random Struct. Algorithms, July, 2024

Set-Coloring Ramsey Numbers and Error-Correcting Codes Near the Zero-Rate Threshold.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, June, 2024

Extremal results on feedback arc sets in digraphs.

[BibT_eX]

[DOI]

Zoe M. Himwich

Nitya Mani

Random Struct. Algorithms, March, 2024

Small subsets with large sumset: Beyond the Cauchy-Davenport bound.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2024

On the clique number of random Cayley graphs and related topics.

[BibT_eX]

[DOI]

CoRR, 2024

Enumeration of Intersection Graphs of x-Monotone Curves.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

A Structure Theorem for Pseudo-Segments and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Hypergraph Ramsey numbers of cliques versus stars.

[BibT_eX]

[DOI]

Random Struct. Algorithms, October, 2023

Three Early Problems on Size Ramsey Numbers.

[BibT_eX]

[DOI]

Comb., August, 2023

Off-diagonal book Ramsey numbers.

[BibT_eX]

[DOI]

Comb. Probab. Comput., May, 2023

Minimum degree and the graph removal lemma.

[BibT_eX]

[DOI]

J. Graph Theory, April, 2023

Making an H $H$ -free graph k $k$ -colorable.

[BibT_eX]

[DOI]

Zoe M. Himwich

Nitya Mani

J. Graph Theory, 2023

Threshold Ramsey multiplicity for paths and even cycles.

[BibT_eX]

[DOI]

Eur. J. Comb., 2023

2022

Clique minors in graphs with a forbidden subgraph.

[BibT_eX]

[DOI]

Matija Bucic

Random Struct. Algorithms, 2022

Multicolor list Ramsey numbers grow exponentially.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Removal lemmas and approximate homomorphisms.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2022

Ramsey Numbers of Books and Quasirandomness.

[BibT_eX]

[DOI]

Comb., 2022

Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021

Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

A Note on the Erdös Distinct Subset Sums Problem.

[BibT_eX]

[DOI]

Quentin Dubroff

Max Wenqiang Xu

SIAM J. Discret. Math., 2021

On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2021

Sets without k-term progressions can have many shorter progressions.

[BibT_eX]

[DOI]

Cosmin Pohoata

Random Struct. Algorithms, 2021

Powers of paths in tournaments.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

Making an $H$-Free Graph $k$-Colorable.

[BibT_eX]

[DOI]

Zoe M. Himwich

Nitya Mani

CoRR, 2021

On the Number of Edges of Separated Multigraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Sunflowers in Set Systems of Bounded Dimension.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Books versus Triangles at the Extremal Density.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

On edge-ordered Ramsey numbers.

[BibT_eX]

[DOI]

Ray Li

Random Struct. Algorithms, 2020

Ramsey, Paper, Scissors.

[BibT_eX]

[DOI]

Xiaoyu He

Random Struct. Algorithms, 2020

Short proofs of some extremal results III.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Towards the linear arboricity conjecture.

[BibT_eX]

[DOI]

Asaf Ferber

Vishesh Jain

J. Comb. Theory B, 2020

On Ramsey numbers of hedgehogs.

[BibT_eX]

[DOI]

Ray Li

Comb. Probab. Comput., 2020

Bounded VC-Dimension Implies the Schur-Erdős Conjecture.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

A proof of Tomescu's graph coloring conjecture.

[BibT_eX]

[DOI]

Xiaoyu He

Freddie Manners

J. Comb. Theory B, 2019

The removal lemma for tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Lines in Euclidean Ramsey Theory.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2019

A fast new algorithm for weak graph regularity.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2019

Induced arithmetic removal: complexity 1 patterns over finite fields.

[BibT_eX]

[DOI]

Jonathan Tidor

CoRR, 2019

Towards Erdős-Hajnal for Graphs with No 5-Hole.

[BibT_eX]

[DOI]

Comb., 2019

Semi-Algebraic Colorings of Complete Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

A polynomial bound for the arithmetic k-cycle removal lemma in vector spaces.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2018

Fast Property Testing and Metrics for Permutations.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2018

Erratum: On Regularity Lemmas and their Algorithmic Applications.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2018

A completion of the proof of the Edge-statistics Conjecture.

[BibT_eX]

[DOI]

CoRR, 2018

Erdős-Ginzburg-Ziv Constants by Avoiding Three-Term Arithmetic Progressions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

Ramsey-Turán Numbers for Semi-Algebraic Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

More Distinct Distances Under Local Conditions.

[BibT_eX]

[DOI]

Comb., 2018

Finding Cliques in Social Networks: A New Distribution-Free Model.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

On the number of cliques in graphs with a forbidden minor.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Ordered Ramsey numbers.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

On the Local Approach to Sidorenko's Conjecture.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

On Regularity Lemmas and their Algorithmic Applications.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2017

A tight lower bound for Szemerédi's regularity lemma.

[BibT_eX]

[DOI]

Comb., 2017

Permutation Property Testing under Different Metrics with Low Query Complexity.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

On the minimum degree of minimal Ramsey graphs for multiple colours.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Short proofs of some extremal results II.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Ramsey numbers of cubes versus cliques.

[BibT_eX]

[DOI]

Comb., 2016

Approximating the Rectilinear Crossing Number.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Discrete Geometry, Algebra, and Combinatorics (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Distinct Volume Subsets.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

The Erdős-Hajnal conjecture for rainbow triangles.

[BibT_eX]

[DOI]

Andrey Grinshpun

J. Comb. Theory B, 2015

Easily Testable Graph Properties.

[BibT_eX]

[DOI]

Noga Alon

Comb. Probab. Comput., 2015

A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing.

[BibT_eX]

[DOI]

CoRR, 2015

The critical window for the classical Ramsey-Turán problem.

[BibT_eX]

[DOI]

Po-Shen Loh

Comb., 2015

Density and regularity theorems for semi-algebraic hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Recent developments in graph Ramsey theory.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics 2015, 2015

2014

Cycle packing.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2014

What is Ramsey-equivalent to a clique?

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Applications of a New Separator Theorem for String Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2014

Short Proofs of Some Extremal Results.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2014

A minimum degree condition forcing complete graph immersion.

[BibT_eX]

[DOI]

Comb., 2014

2013

The Number of Edges in k-Quasi-planar Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Tournaments and colouring.

[BibT_eX]

[DOI]

Eli Berger

Krzysztof Choromanski

J. Comb. Theory B, 2013

A note on light geometric graphs.

[BibT_eX]

[DOI]

Eyal Ackerman

Rom Pinchasi

Discret. Math., 2013

An improved bound for the stepping-up lemma.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Stanley-Wilf limits are typically exponential.

[BibT_eX]

[DOI]

CoRR, 2013

Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz.

[BibT_eX]

[DOI]

Choongbum Lee

Comb., 2013

Ramsey-type results for semi-algebraic relations.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

Graph removal lemmas.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics 2013, 2013

2012

Erdős-Hajnal-type theorems in hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Coloring Kk-free intersection graphs of geometric objects in the plane.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Graph removal lemmas

[BibT_eX]

[DOI]

CoRR, 2012

Extremal results in sparse pseudorandom graphs

[BibT_eX]

[DOI]

CoRR, 2012

On a problem of Erdös and Rothschild on edges in triangles.

[BibT_eX]

[DOI]

Po-Shen Loh

Comb., 2012

On two problems in graph Ramsey theory.

[BibT_eX]

[DOI]

Comb., 2012

String graphs and incomparability graphs.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

Dependent random choice.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

Intersection patterns of curves.

[BibT_eX]

[DOI]

Csaba D. Tóth

J. Lond. Math. Soc., 2011

Two extensions of Ramsey's theorem

[BibT_eX]

[DOI]

CoRR, 2011

Testing perfection is hard

[BibT_eX]

[DOI]

Noga Alon

CoRR, 2011

Constructing dense graphs with sublinear Hadwiger number

[BibT_eX]

[DOI]

CoRR, 2011

Bounds for graph regularity and removal lemmas

[BibT_eX]

[DOI]

CoRR, 2011

Computing the Independence Number of Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Overlap properties of geometric expanders.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Complete Minors and Independence Number.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Decompositions into Subgraphs of Small Diameter.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2010

Directed Graphs Without Short Cycles.

[BibT_eX]

[DOI]

Peter Keevash

Comb. Probab. Comput., 2010

Maximum union-free subfamilies

[BibT_eX]

[DOI]

Choongbum Lee

CoRR, 2010

A new proof of the graph removal lemma

[BibT_eX]

[DOI]

CoRR, 2010

Crossings between Curves with Many Tangencies.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

2009

Ramsey numbers of sparse hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

Large induced trees in Kr-free graphs.

[BibT_eX]

[DOI]

Po-Shen Loh

J. Comb. Theory B, 2009

Two remarks on the Burr-Erdos conjecture.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

A bipartite analogue of Dilworth's theorem for multiple partial orders.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

Paths and Stability Number in Digraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

Crossings, Colorings, and Cliques.

[BibT_eX]

[DOI]

Michael O. Albertson

Daniel W. Cranston

Electron. J. Comb., 2009

Density theorems for bipartite graphs and related Ramsey-type results.

[BibT_eX]

[DOI]

Comb., 2009

A Separator Theorem for String Graphs and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

On grids in topological graphs.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

Ramsey-Type Problem for an Almost Monochromatic K4.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

There exist graphs with super-exponential Ramsey multiplicity constant.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

On a problem of Duke-Erdös-Rödl on cycle-connected subgraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Unavoidable patterns.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2008

Rainbow solutions to the Sidon equation.

[BibT_eX]

[DOI]

Mohammad Mahdian

Rados Radoicic

Discret. Math., 2008

Coloring kk-free intersection graphs of geometric objects in the plane.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

The minimum degree of Ramsey-minimal graphs.

[BibT_eX]

[DOI]

Kathy Lin

J. Graph Theory, 2007

An infinite color analogue of Rado's theorem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2007

Induced Ramsey-type theorems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples.

[BibT_eX]

[DOI]

Veselin Jungic

Rados Radoicic

Electron. Notes Discret. Math., 2007

A Bipartite Strengthening of the Crossing Lemma.

[BibT_eX]

[DOI]

Csaba D. Tóth

Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006

A Bipartite Analogue of Dilworth's Theorem.

[BibT_eX]

[DOI]

Order, 2006

On Rado's Boundedness Conjecture.

[BibT_eX]

[DOI]

Daniel J. Kleitman

J. Comb. Theory A, 2006

On the Decay of Crossing Numbers.

[BibT_eX]

[DOI]