On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
From MaRDI portal
Publication:653983
DOI10.1007/s00493-011-2626-3zbMath1249.05197OpenAlexW1984962604MaRDI QIDQ653983
Publication date: 20 December 2011
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-011-2626-3
Related Items (17)
On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ On the Ramsey-Turán number with small \(s\)-independence number ⋮ The minimum degree of minimal Ramsey graphs for cliques ⋮ On some generalized vertex Folkman numbers ⋮ Quasiplanar graphs, string graphs, and the Erdős-Gallai problem ⋮ Chromatic vertex Folkman numbers ⋮ On vertex Ramsey graphs with forbidden subgraphs ⋮ The asymptotics of \(r(4,t)\) ⋮ On generalized Ramsey numbers of Erdős and Rogers ⋮ \(K_4\)-free graphs without large induced triangle-free subgraphs ⋮ Short Proofs of Some Extremal Results ⋮ On the nonexistence of some generalized Folkman numbers ⋮ When does the K4‐free process stop? ⋮ Dependent random choice ⋮ On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs ⋮ On Some Open Questions for Ramsey and Folkman Numbers ⋮ On the Stability of the Graph Independence Number
Cites Work
- Unnamed Item
- Unnamed Item
- New upper bound for a class of vertex Folkman numbers
- An almost quadratic bound on vertex Folkman numbers
- Graphs without large triangle free subgraphs
- The Ramsey property for graphs with forbidden complete subgraphs
- A Ramsey type problem concerning vertex colourings
- Constructive bounds for a Ramsey-type problem
- On the triangle vertex Folkman numbers
- A new lower bound for a Ramsey-type problem
- A Canonical Ramsey Theorem
- Ks-Free Graphs Without Large Kr-Free Subgraphs
- Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems
- Bounding Ramsey numbers through large deviation inequalities
- New Upper Bound on Vertex Folkman Numbers
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- The Construction of Certain Graphs
- On minimal Folkman graphs
This page was built for publication: On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers