On a conjecture of Thomassen concerning subgraphs of large girth

DOI10.1002/jgt.20534zbMath1231.05144OpenAlexW2070760570WikidataQ123335073 ScholiaQ123335073MaRDI QIDQ5199421

Daniel M. Martin, Domingos jun. Dellamonica, Vojtěch Rödl, Václav Koubek

Publication date: 16 August 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20534

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

\(C_4\)-free subgraphs with large average degree ⋮ Triangle-free subgraphs with large fractional chromatic number ⋮ A note on Thomassen's conjecture ⋮ Hypergraphs with pendant paths are not chromatically unique ⋮ Dense Induced Subgraphs of Dense Bipartite Graphs

Cites Work

• Unnamed Item
• On finite set-systems whose every intersection is a kernel of a star
• Girth in graphs
• Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree
• Dense graphs without 3-regular subgraphs
• On the Chromatic Number of Subgraphs of a Given Graph
• On coloring graphs to maximize the proportion of multicolored k-edges

This page was built for publication: On a conjecture of Thomassen concerning subgraphs of large girth