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

DOI10.1002/RSA.20035MaRDI QIDQ4680408zbMATH OpenOpenAlexFDO

Authors Benny 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)

Recommendations

• K^s-Free Graphs Without Large K^r-Free Subgraphs
• Ramsey Numbers and the Size of Graphs
• A new lower bound for a Ramsey-type problem
• On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
• On book-complete graph Ramsey numbers

Cites work

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

Cited in

(27)

• Two remarks on the Burr-Erdős conjecture
• \(K_4\)-free graphs without large induced triangle-free subgraphs
• Ramsey for complete graphs with a dropped edge or a triangle
• On a problem of Erdős and Rothschild on edges in triangles
• A new lower bound for a Ramsey-type problem
• Dependent random choice
• On the Ramsey-Turán number with small s-independence number
• K^s-Free Graphs Without Large K^r-Free Subgraphs
• On generalized Ramsey numbers of Erdős and Rogers
• On the stability of the graph independence number
• Short proofs of some extremal results
• When does the \(K_{4}\)-free process stop?
• On generalized Ramsey numbers for 3-uniform hypergraphs
• Ramsey numbers of sparse hypergraphs
• Ramsey numbers of large books
• Ramsey non-goodness involving books
• Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
• On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
• Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
• Ramsey numbers and a general Erdős-Rogers function
• Two Ramsey-Turán numbers of small independence numbers
• Induced subgraphs of K_r-free graphs and the Erdős-Rogers problem
• Improved bounds for the Erdős-Rogers (s, s+2)-problem
• On the maximum F-free induced subgraphs in K_t-free graphs
• On the order of the classical Erdős-Rogers functions
• On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs
• An almost quadratic bound on vertex Folkman numbers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680408)