Cycles in graphs with large independence ratio

DOI10.4310/JOC.2011.V2.N1.A3zbMATH Open1284.05151OpenAlexW2317039618MaRDI QIDQ635856FDOQ635856

Authors: Benny Sudakov, J. Verstraëte 

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

Recommendations

• On the ultimate independence ratio of a graph
• On the bounds for the ultimate independence ratio of a graph
• Approximating Vizing's independence number conjecture
• scientific article; zbMATH DE number 4049676
• Cycles in triangle-free graphs of large chromatic number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cited In (6)

• Cycles in triangle-free graphs of large chromatic number
• Large cycles in generalized Johnson graphs
• Cycle factors in dense graphs
• On the ultimate independence ratio of a graph
• A solution to Erdős and Hajnal’s odd cycle problem
• A sufficient condition guaranteeing large cycles in graphs

This page was built for publication: Cycles in graphs with large independence ratio

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635856)