On the Stability of the Graph Independence Number
From MaRDI portal
Publication:5028354
DOI10.1137/21M1405071zbMath1486.05227arXiv2102.13306OpenAlexW4205304303MaRDI QIDQ5028354
Publication date: 9 February 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.13306
Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- On generalized Ramsey numbers of Erdős and Rogers
- On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
- Graphs without large triangle free subgraphs
- \(K_4\)-free graphs without large induced triangle-free subgraphs
- A new lower bound for a Ramsey-type problem
- On the Function of Erdős and Rogers
- Local resilience of graphs
- 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
- Improved bounds for the Erdős-Rogers function
- On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs
- The Construction of Certain Graphs
- Some Theorems on Abstract Graphs
This page was built for publication: On the Stability of the Graph Independence Number