Graphs without short odd cycles are nearly bipartite

DOI10.1016/0012-365X(95)00321-MzbMath0871.05040OpenAlexW2035503643MaRDI QIDQ1356557

Alexandr V. Kostochka, Tomasz Łuczak, Ervin Gyoeri

Publication date: 24 September 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00321-m

zbMATH Keywords

odd cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (6)

Dense graphs with small clique number ⋮ The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size ⋮ Nearly bipartite graphs ⋮ Adjacency eigenvalues of graphs without short odd cycles ⋮ Unnamed Item ⋮ Characterizations of bipartite Steinhaus graphs

This page was built for publication: Graphs without short odd cycles are nearly bipartite