Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems

DOI10.1002/rsa.20035zbMath1062.05100OpenAlexW3083502596MaRDI QIDQ4680408

Benjamin Sudakov

Publication date: 1 June 2005

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20035

zbMATH Keywords

coloringprobabilistic arguments

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Related Items (18)

On the Ramsey-Turán number with small \(s\)-independence number ⋮ Ramsey for complete graphs with a dropped edge or a triangle ⋮ Ramsey numbers of large books ⋮ Ramsey non-goodness involving books ⋮ Quasiplanar graphs, string graphs, and the Erdős-Gallai problem ⋮ On generalized Ramsey numbers of Erdős and Rogers ⋮ On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers ⋮ On a problem of Erdős and Rothschild on edges in triangles ⋮ On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs ⋮ \(K_4\)-free graphs without large induced triangle-free subgraphs ⋮ Short Proofs of Some Extremal Results ⋮ When does the K₄‐free process stop? ⋮ An almost quadratic bound on vertex Folkman numbers ⋮ Dependent random choice ⋮ Ramsey numbers of sparse hypergraphs ⋮ Two remarks on the Burr-Erdős conjecture ⋮ On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs ⋮ On the Stability of the Graph Independence Number

Cites Work

• Constructive bounds for a Ramsey-type problem
• K^s-Free Graphs Without Large K^r-Free Subgraphs
• On uncrowded hypergraphs
• The Construction of Certain Graphs

This page was built for publication: Large K_r‐free subgraphs in K_s‐free graphs and some other Ramsey‐type problems