Ramsey-type theorems
From MaRDI portal
Publication:751670
DOI10.1016/0166-218X(89)90045-0zbMATH Open0715.05052OpenAlexW2007044730WikidataQ56227671 ScholiaQ56227671MaRDI QIDQ751670FDOQ751670
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(89)90045-0
Recommendations
Combinatorial aspects of partitions of integers (05A17) Generalized Ramsey theory (05C55) Hypergraphs (05C65)
Cites Work
- On some extremal problems on \(r\)-graphs
- Graph Theory and Probability
- Intersection theorems with geometric consequences
- Some remarks on the theory of graphs
- Asymptotic lower bounds for Ramsey functions
- Title not available (Why is that?)
- On chromatic number of graphs and set-systems
- On a Ramsey type theorem
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- On cycle—Complete graph ramsey numbers
- Combinatorial set theory: Partition relations for cardinals
- Embedding theorems for graphs establishing negative partition relations
- Partition relations for cardinal numbers
- Title not available (Why is that?)
- On the perfect graph conjecture
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- On high-dimensional acyclic tournaments
- Two extensions of Ramsey's theorem
- Ordered graphs and large bi-cliques in intersection graphs of curves
- On 3‐graphs with no four vertices spanning exactly two edges
- Erdös--Hajnal Properties for Powers of Sparse Graphs
- A maximum degree theorem for diameter-2-critical graphs
- On low rank-width colorings
- Large almost monochromatic subsets in hypergraphs
- The Erdős-Hajnal conjecture for rainbow triangles
- Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
- Ramsey properties of algebraic graphs and hypergraphs
- Applications of a New Separator Theorem for String Graphs
- Strong cliques in diamond-free graphs
- Some Ramsey-type theorems
- The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
- On the Erdős-Hajnal conjecture for six-vertex tournaments
- A Ramsey-Type Theorem in the Plane
- Title not available (Why is that?)
- The Erdős-Hajnal conjecture for paths and antipaths
- A parametrization of the abstract Ramsey theorem
- The Erdős-Hajnal conjecture. A survey
- On homogeneous sets of positive integers
- Triangle-free graphs with no six-vertex induced path
- Turán-type results for partial orders and intersection graphs of convex sets
- Some properties of edge intersection graphs of single bend paths on a grid
- Erdős-Hajnal-type results for monotone paths
- 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
- Title not available (Why is that?)
- A crossing lemma for Jordan curves
- Non-Ramsey graphs are \(c\log n\)-universal
- Tournaments with near-linear transitive subsets
- Induced subgraphs of Ramsey graphs with many distinct degrees
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension
- Short proofs of some extremal results. II.
- A bipartite analogue of Dilworth's theorem for multiple partial orders
- Erdős-Hajnal-type theorems in hypergraphs
- The Erdős-Hajnal conjecture for long holes and antiholes
- Crossing patterns of semi-algebraic sets
- Induced Ramsey-type theorems
- On Erdős-Rado numbers
- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
- Erdős--Szekeres theorem with forbidden order types
- Erdős-Szekeres theorem for point sets with forbidden subconfigurations
- Ramsey's theorem for sums, products, and arithmetic progressions
- Excluding hooks and their complements
- Hypergraph Ramsey numbers
- Title not available (Why is that?)
- Upper bounds for Erdös-Hajnal coefficients of tournaments
- Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal
- Total domination edge critical graphs with total domination number three and many dominating pairs
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
- Multi-dimensional Ramsey theorems -- an example
- Complete Partite subgraphs in dense hypergraphs
- Coloring tournaments: from local to global
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Erdös–Hajnal conjecture for new infinite families of tournaments
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
- Disjoint edges in complete topological graphs
- Induced Turán Numbers
- Graph classes with linear Ramsey numbers
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
- Induced Ramsey-type theorems
- The Erdős-Hajnal conjecture for bull-free graphs
- Two Erdős-Hajnal-type theorems in hypergraphs
- Ramsey graphs contain many distinct induced subgraphs
- An application of the Ramsey theorem to ordered r-tournaments
- Excluding paths and antipaths
- The edge density of critical digraphs
- Tournaments and the strong Erdős-Hajnal property
- Bounded \(VC\)-dimension implies the Schur-Erdős conjecture
- A New Bound for the 2/3 Conjecture
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- Title not available (Why is that?)
- Ramsey type theorems for real functions
- Pure pairs. II: Excluding all subdivisions of a graph
- Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs
- Regular partitions of gentle graphs
- Pure pairs. I: Trees and linear anticomplete pairs
- Title not available (Why is that?)
- Title not available (Why is that?)
- \( \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
- Singular Ramsey and Turán numbers
- Strong Erdős-Hajnal properties in chordal graphs
- Structure and regularity for subsets of groups with finite VC-dimension
- Graphs with Large Obstacle Numbers
- A further extension of Rödl's theorem
- On Betti numbers of flag complexes with forbidden induced subgraphs
- Universality of Graphs with Few Triangles and Anti-Triangles
- The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
- Disjoint induced subgraphs of the same order and size
- Lower bounds for hypergraph Ramsey numbers
- A note on the Erdős-Hajnal property for stable graphs
- Erdős–Hajnal for graphs with no 5‐hole
- Essentially tight kernels for (weakly) closed graphs
- Caterpillars in Erdős-Hajnal
- About the Erdős-Hajnal conjecture for seven-vertex tournaments
- A simple \((2 + \epsilon)\)-approximation algorithm for split vertex deletion
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)
