Graphs without large triangle free subgraphs
From MaRDI portal
Publication:1174161
DOI10.1016/0012-365X(91)90042-ZzbMath0767.05083OpenAlexW2029971820MaRDI QIDQ1174161
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(91)90042-z
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)
Related Items (14)
On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ On the Ramsey-Turán number with small \(s\)-independence number ⋮ Local-Global Phenomena in Graphs ⋮ Constructive bounds for a Ramsey-type problem ⋮ Ks-Free Graphs Without Large Kr-Free Subgraphs ⋮ On vertex Ramsey graphs with forbidden subgraphs ⋮ 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 ⋮ When does the K4‐free process stop? ⋮ An almost quadratic bound on vertex Folkman numbers ⋮ 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
This page was built for publication: Graphs without large triangle free subgraphs