Ramsey-type theorems
From MaRDI portal
Publication:751670
DOI10.1016/0166-218X(89)90045-0zbMath0715.05052OpenAlexW2007044730WikidataQ56227671 ScholiaQ56227671MaRDI QIDQ751670
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
Combinatorial aspects of partitions of integers (05A17) Hypergraphs (05C65) Generalized Ramsey theory (05C55)
Related Items
Erdös–Hajnal conjecture for new infinite families of tournaments, Essentially tight kernels for (weakly) closed graphs, A further extension of Rödl's theorem, Towards the Erdős-Hajnal conjecture for \(P_5\)-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, Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs, 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, Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs, Graphs of large chromatic number, Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons, Clique covers of \(H\)-free graphs, Forests and the strong Erdős-Hajnal property, Unnamed Item, Structure and regularity for subsets of groups with finite VC-dimension, On the Erdős-Hajnal conjecture for six-vertex tournaments, An improvement of spectral conditions for Hamilton-connected graphs, Weighted Rooted Trees: Fat or Tall?, Ramsey properties of algebraic graphs and hypergraphs, Erdős--Szekeres theorem with forbidden order types, A characterization of claw-free CIS graphs and new results on the order of CIS graphs, Identifying Codes in Hereditary Classes of Graphs and VC-Dimension, Triangle-free graphs with no six-vertex induced path, Lower bounds for hypergraph Ramsey numbers, Perfect Graphs of Fixed Density: Counting and Homogeneous Sets, Short proofs of some extremal results. II., A crossing lemma for Jordan curves, SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY, For most graphs H , most H -free graphs have a linear homogeneous set, Graph classes with linear Ramsey numbers, Graphs in which each \(C_4\) spans \(K_4\), The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor, Excluding hooks and their complements, Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs, Turán-type results for partial orders and intersection graphs of convex sets, Induced subgraphs of Ramsey graphs with many distinct degrees, Erdős-Hajnal conjecture for graphs with bounded VC-dimension, On high-dimensional acyclic tournaments, Pure pairs. IV: Trees in bipartite graphs, On 3‐graphs with no four vertices spanning exactly two edges, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs, About the Erdős-Hajnal conjecture for seven-vertex tournaments, Polynomial bounds for chromatic number II: Excluding a star‐forest, Polynomial bounds for chromatic number. III. Excluding a double star, A maximum degree theorem for diameter-2-critical graphs, Erdős–Hajnal for graphs with no 5‐hole, Pure pairs. X. Tournaments and the strong Erdős-Hajnal property, Caterpillars in Erdős-Hajnal, A note on the Erdős-Hajnal property for stable graphs, Some problems on induced subgraphs, Near-domination in graphs, Unnamed Item, On Betti numbers of flag complexes with forbidden induced subgraphs, An improvement of sufficient condition for \(k\)-leaf-connected graphs, Universality of Graphs with Few Triangles and Anti-Triangles, Forbidding couples of tournaments and the Erdös-Hajnal conjecture, Erdős-Szekeres theorem for point sets with forbidden subconfigurations, Pure pairs. I: Trees and linear anticomplete pairs, Many disjoint edges in topological graphs, Regular partitions of gentle graphs, All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs, Tournaments with near-linear transitive subsets, Two Erdős-Hajnal-type theorems in hypergraphs, Some properties of edge intersection graphs of single-bend paths on a grid, 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, Erdős-Hajnal-type results for monotone paths, Erdős-Hajnal for cap-free graphs, Induced Turán Numbers, Many disjoint edges in topological graphs, Induced Ramsey-type theorems, Induced Ramsey-type theorems, The edge density of critical digraphs, Excluding paths and antipaths, The Erdős-Hajnal conjecture for bull-free graphs, Applications of a New Separator Theorem for String Graphs, Large almost monochromatic subsets in hypergraphs, A New Bound for the 2/3 Conjecture, The Erdős-Hajnal conjecture for rainbow triangles, Hypergraph Ramsey numbers, Unnamed Item, Erdős-Hajnal-type theorems in hypergraphs, Graphs with Large Obstacle Numbers, On low rank-width colorings, Disjoint edges in complete topological graphs, Vertex-minors and the Erdős-Hajnal conjecture, Pure pairs. II: Excluding all subdivisions of a graph, Strong cliques in diamond-free graphs, The Erdös--Hajnal Conjecture for Long Holes and Antiholes, Non-Ramsey graphs are \(c\log n\)-universal, Coloring tournaments: from local to global, Bounded \(VC\)-dimension implies the Schur-Erdős conjecture, Tournaments and the strong Erdős-Hajnal property, Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal, The structure of bull-free graphs I -- three-edge-paths with centers and anticenters, Ordered graphs and large bi-cliques in intersection graphs of curves, Bipartite Independence Number in Graphs with Bounded Maximum Degree, A bipartite analogue of Dilworth's theorem for multiple partial orders, Crossing patterns of semi-algebraic sets, On Erdős-Rado numbers, Some properties of edge intersection graphs of single bend paths on a grid, Upper Bounds for Erdös-Hajnal Coefficients of Tournaments, Large Homogeneous Submatrices, Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds, Erdös--Hajnal Properties for Powers of Sparse Graphs, Ramsey graphs contain many distinct induced subgraphs, The Erdős-Hajnal conjecture for paths and antipaths, Pure Pairs VI: Excluding an Ordered Tree, Disjoint induced subgraphs of the same order and size, The Erdös-Hajnal Conjecture-A Survey, The Erdős-Hajnal conjecture for three colors and triangles, Complete Partite subgraphs in dense hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial set theory: Partition relations for cardinals
- Intersection theorems with geometric consequences
- Asymptotic lower bounds for Ramsey functions
- Embedding theorems for graphs establishing negative partition relations
- On the perfect graph conjecture
- On some extremal problems on \(r\)-graphs
- On a Ramsey type theorem
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- Graph Theory and Probability
- On cycle—Complete graph ramsey numbers
- On chromatic number of graphs and set-systems
- Partition relations for cardinal numbers
- Some remarks on the theory of graphs
