- The minimum degree of Ramsey-minimal graphs
- Large almost monochromatic subsets in hypergraphs David Conlon
- ON MINIMAL COLORINGS WITHOUT MONOCHROMATIC SOLUTIONS TO A LINEAR EQUATION
- Erdos-Hajnal-type theorems in hypergraphs David Conlon
- Paths and stability number in digraphs Benny Sudakov
- Submitted exclusively to the London Mathematical Society doi:10.1112/0000/000000
- An infinite color analogue of Rado's theorem Princeton University, Princeton, NJ 08540, USA
- There exist graphs with super-exponential Ramsey multiplicity The Ramsey multiplicity M(G; n) of a graph G is the minimum number of monochromatic
- Two remarks on the Burr-Erdos conjecture Benny Sudakov
- On two problems in graph Ramsey theory David Conlon
- Coloring Kk-free intersection graphs of geometric objects in the plane
- An approximate version of Sidorenko's conjecture David Conlon
- A new proof of the graph removal lemma Let H be a fixed graph with h vertices. The graph removal lemma states that every graph on n
- Crossings between curves with many tangencies , Fabrizio Frati
- Decompositions into subgraphs of small diameter Benny Sudakov
- A Bipartite Analogue of Dilworth's Theorem for Multiple Partial Orders
- Directed graphs without short cycles Peter Keevash
- Sub-Ramsey Numbers for Arithmetic Progressions and Schur Jacob Fox Veselin Jungicy Rados Radoicicz
- Ramsey numbers of sparse hypergraphs David Conlon
- A Bipartite Strengthening of the Crossing Lemma Janos Pach
- String graphs and incomparability graphs Janos Pach
- A separator theorem for string graphs and its applications Janos Pach
- Hypergraph Ramsey numbers David Conlon
- Maximum union-free subfamilies Choongbum Lee
- Computing the Independence Number of Intersection Graphs Janos Pach
- An improved bound for the stepping-up lemma David Conlon
- Dependent Random Choice Benny Sudakov
- Turan-type results for partial orders and intersection graphs of convex sets
- Complete minors and independence number Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies
- Crossings, colorings, and cliques Michael O. Albertson
- On Grids in Topological Graphs Eyal Ackerman1
- SEPARATOR THEOREMS AND TURAN-TYPE RESULTS FOR PLANAR INTERSECTION GRAPHS
- On a problem of Duke-Erdos-Rodl on cycle-connected subgraphs Benny Sudakov
- Ramsey-type problem for an almost monochromatic K4 Benny Sudakov
- ErdosHajnal-type results on intersection patterns of geometric objects
- On the decay of crossing numbers Csaba D. Toth
- A Bipartite Analogue of Dilworth's Theorem Massachusetts Institute of Technology, Cambridge, MA 02139, USA
- On Rado's Boundedness Conjecture Massachusetts Institute of Technology
- Combinatorics, Probability and Computing (2003) 12, 599620. c 2003 Cambridge University Press DOI: 10.1017/S096354830300587X Printed in the United Kingdom
- Minimum degree condition forcing complete graph immersion Department of Mathematics
- On the degree of regularity of generalized van der Waerden triples
- Erdos-Szekeres-type theorems for monotone paths and convex bodies
- On two problems in graph Ramsey theory David Conlon
- Chromatic number, clique subdivisions, and the conjectures of Hajos and Erdos-Fajtlowicz
- Bounds for graph regularity and removal lemmas David Conlon
- Two extensions of Ramsey's theorem David Conlon
- arXiv:1108.4953v2[math.CO]26Aug2011 Constructing dense graphs with sublinear Hadwiger number
- The number of edges in k-quasi-planar graphs Janos Pach
- Two extensions of Ramsey's theorem David Conlon