Recommendations
Cites work
- scientific article; zbMATH DE number 3166040 (Why is no real title available?)
- scientific article; zbMATH DE number 3557819 (Why is no real title available?)
- scientific article; zbMATH DE number 3628985 (Why is no real title available?)
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- Asymptotic lower bounds for Ramsey functions
- Combinatorial set theory: Partition relations for cardinals
- Embedding theorems for graphs establishing negative partition relations
- Graph Theory and Probability
- Intersection theorems with geometric consequences
- On a Ramsey type theorem
- On chromatic number of graphs and set-systems
- On cycle—Complete graph ramsey numbers
- On some extremal problems on r-graphs
- On the perfect graph conjecture
- Partition relations for cardinal numbers
- Some remarks on the theory of graphs
Cited in
(only showing first 100 items - show all)- On high-dimensional acyclic tournaments
- Two extensions of Ramsey's theorem
- Perfect graphs of fixed density: counting and homogeneous sets
- Refinement of homogeneity and Ramsey numbers
- Ramsey type theorems for real functions
- Large homogeneous submatrices
- scientific article; zbMATH DE number 7651162 (Why is no real title available?)
- Pure pairs. II: Excluding all subdivisions of a graph
- A maximum degree theorem for diameter-2-critical graphs
- Ordered graphs and large bi-cliques in intersection graphs of curves
- Large almost monochromatic subsets in hypergraphs
- Regular partitions of gentle graphs
- On 3‐graphs with no four vertices spanning exactly two edges
- On low rank-width colorings
- Pure pairs. I: Trees and linear anticomplete pairs
- Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs
- scientific article; zbMATH DE number 734459 (Why is no real title available?)
- scientific article; zbMATH DE number 970803 (Why is no real title available?)
- \( \chi \)-binding function for \((C_4, t\text{-broom}^+)\)-free graphs
- Strengthening Brooks' chromatic bound on \(P_6\)-free graphs
- Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph
- The Erdős-Hajnal conjecture for rainbow triangles
- Singular Ramsey and Turán numbers
- Identifying codes in hereditary classes of graphs and VC-dimension
- Some Ramsey-type theorems
- Structure and regularity for subsets of groups with finite VC-dimension
- Strong Erdős-Hajnal properties in chordal graphs
- The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
- On the Erdős-Hajnal conjecture for six-vertex tournaments
- Ramsey properties of algebraic graphs and hypergraphs
- Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
- Strong cliques in diamond-free graphs
- A further extension of Rödl's theorem
- On Betti numbers of flag complexes with forbidden induced subgraphs
- The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
- A Ramsey-Type Theorem in the Plane
- Disjoint induced subgraphs of the same order and size
- Bipartite independence number in graphs with bounded maximum degree
- Lower bounds for hypergraph Ramsey numbers
- The Erdős-Hajnal conjecture for paths and antipaths
- scientific article; zbMATH DE number 6378629 (Why is no real title available?)
- A parametrization of the abstract Ramsey theorem
- Turán-type results for partial orders and intersection graphs of convex sets
- The Erdős-Hajnal conjecture. A survey
- On homogeneous sets of positive integers
- Triangle-free graphs with no six-vertex induced path
- Erdös-Hajnal properties for powers of sparse graphs
- A note on the Erdős-Hajnal property for stable graphs
- Induced Turán numbers
- Some properties of edge intersection graphs of single bend paths on a grid
- A new bound for the 2/3 conjecture
- Erdős-Hajnal-type results for monotone paths
- Erdős–Hajnal for graphs with no 5‐hole
- Essentially tight kernels for (weakly) closed graphs
- Caterpillars in Erdős-Hajnal
- Some properties of edge intersection graphs of single-bend paths on a grid
- A characterization of claw-free CIS graphs and new results on the order of CIS graphs
- scientific article; zbMATH DE number 1047745 (Why is no real title available?)
- About the Erdős-Hajnal conjecture for seven-vertex tournaments
- A crossing lemma for Jordan curves
- A simple \((2 + \epsilon)\)-approximation algorithm for split vertex deletion
- Ramsey theory on Steiner triples
- Tournaments with near-linear transitive subsets
- Non-Ramsey graphs are c n-universal
- Induced subgraphs of Ramsey graphs with many distinct degrees
- Complete partite subgraphs in dense hypergraphs
- Applications of a new separator theorem for string graphs
- Graphs in which each \(C_4\) spans \(K_4\)
- Many disjoint edges in topological graphs
- Polynomial bounds for chromatic number II: Excluding a star‐forest
- Polynomial bounds for chromatic number. III. Excluding a double star
- Short proofs of some extremal results. II.
- A bipartite analogue of Dilworth's theorem for multiple partial orders
- Hitting all maximum stable sets in \(P_5\)-free graphs
- The regularity of almost all edge ideals
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
- String graphs have the Erdős-Hajnal property
- Weighted Rooted Trees: Fat or Tall?
- Erdős-Hajnal-type theorems in hypergraphs
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
- Ramsey numbers of sparse digraphs
- Crossing patterns of semi-algebraic sets
- The Erdős-Hajnal conjecture for long holes and antiholes
- Forbidding couples of tournaments and the Erdös-Hajnal conjecture
- Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs
- Graphs of large chromatic number
- Vertex-minors and the Erdős-Hajnal conjecture
- Universality of graphs with few triangles and anti-triangles
- Pure pairs. X. Tournaments and the strong Erdős-Hajnal property
- Large cliques or cocliques in hypergraphs with forbidden order-size pairs
- On Erdős-Rado numbers
- Erdős-Szekeres theorem for point sets with forbidden subconfigurations
- Ramsey's theorem for sums, products, and arithmetic progressions
- Erdős--Szekeres theorem with forbidden order types
- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
- Induced Ramsey-type theorems
- Excluding hooks and their complements
- Topics in Gallai-Ramsey Theory
- Clique covers of \(H\)-free graphs
- Forests and the strong Erdős-Hajnal property
This page was built for publication: Ramsey-type theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751670)
