Ramsey-type theorems with forbidden subgraphs
From MaRDI portal
Publication:5955193
DOI10.1007/s004930100016zbMath0989.05124OpenAlexW2052533725MaRDI QIDQ5955193
Noga Alon, József Solymosi, János Pach
Publication date: 13 February 2002
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930100016
Related Items
On the Erdős-Hajnal conjecture for six-vertex tournaments, Erdős--Szekeres theorem with forbidden order types, Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement, For most graphs H , most H -free graphs have a linear homogeneous set, Excluding hooks and their complements, Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs, Structure Theorem forU5-free Tournaments, Turán-type results for partial orders and intersection graphs of convex sets, Erdős-Hajnal conjecture for graphs with bounded VC-dimension, On high-dimensional acyclic tournaments, Combinatorics. Abstracts from the workshop held January 1--7, 2023, About the Erdős-Hajnal conjecture for seven-vertex tournaments, Erdős–Hajnal for graphs with no 5‐hole, Pure pairs. X. Tournaments and the strong Erdős-Hajnal property, Erdös–Hajnal conjecture for new infinite families of tournaments, Near-domination in graphs, Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs, The regularity of almost all edge ideals, Graphs of large chromatic number, Forests and the strong Erdős-Hajnal property, Problems and results in extremal combinatorics. I., Forbidding couples of tournaments and the Erdös-Hajnal conjecture, Erdős-Szekeres theorem for point sets with forbidden subconfigurations, Unnamed Item, Tournaments with near-linear transitive subsets, Two Erdős-Hajnal-type theorems in hypergraphs, Classes of graphs with low complexity: the case of classes with bounded linear rankwidth, Erdős-Hajnal-type results for monotone paths, Erdős-Hajnal for cap-free graphs, Induced Ramsey-type theorems, Excluding paths and antipaths, A tournament approach to pattern avoiding matrices, The Erdős-Hajnal conjecture for bull-free graphs, The Erdős-Hajnal conjecture for rainbow triangles, Erdős-Hajnal-type theorems in hypergraphs, Connected obstructions to full graph homomorphisms, The Erdös--Hajnal Conjecture for Long Holes and Antiholes, Coloring tournaments: from local to global, Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs, Tournaments and the strong Erdős-Hajnal property, Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal, Dualities in full homomorphisms, Acyclic subgraphs of tournaments with high chromatic number, Crossing patterns of semi-algebraic sets, Upper Bounds for Erdös-Hajnal Coefficients of Tournaments, Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds, Forcing large transitive subtournaments, The Erdős-Hajnal conjecture for paths and antipaths, Pure Pairs VI: Excluding an Ordered Tree, EH-suprema of tournaments with no nontrivial homogeneous sets, The Erdös-Hajnal Conjecture-A Survey
