Cycles in graphs with large independence ratio
From MaRDI portal
Publication:635856
DOI10.4310/JOC.2011.V2.N1.A3zbMath1284.05151OpenAlexW2317039618MaRDI QIDQ635856
Jacques Verstraete, Benjamin Sudakov
Publication date: 23 August 2011
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4310/joc.2011.v2.n1.a3
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
A solution to Erdős and Hajnal’s odd cycle problem ⋮ Cycles in triangle-free graphs of large chromatic number
This page was built for publication: Cycles in graphs with large independence ratio
