Ks-Free Graphs Without Large Kr-Free Subgraphs
From MaRDI portal
Publication:4314152
DOI10.1017/S0963548300001243zbMath0810.05040OpenAlexW2254576550MaRDI QIDQ4314152
Publication date: 9 April 1995
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300001243
Related Items
On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ On the Ramsey-Turán number with small \(s\)-independence number ⋮ Constructive bounds for a Ramsey-type problem ⋮ Bounding Ramsey numbers through large deviation inequalities ⋮ 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 ⋮ \(K_4\)-free graphs without large induced triangle-free subgraphs ⋮ Short Proofs of Some Extremal Results ⋮ An almost quadratic bound on vertex Folkman numbers ⋮ Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems ⋮ On the minimal number of edges in color-critical graphs ⋮ On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs ⋮ On the Stability of the Graph Independence Number
Cites Work
