Graphs with bounded tree-width and large odd-girth are almost bipartite

Simple item page
dc.creatorKostochka, Alexandr V.
dc.creatorKral', Daniel
dc.creatorSereni, Jean-Sebastien
dc.creatorStiebitz, Michael
dc.date2009-04-15
dc.date.accessioned2026-07-07T13:04:13Z
dc.date.available2026-07-07T13:04:13Z
dc.descriptionWe prove that for every $k$ and every $\varepsilon>0$, there exists $g$ such that every graph with tree-width at most $k$ and odd-girth at least $g$ has circular chromatic number at most $2+\varepsilon$.
dc.identifierhttps://arxiv.org/abs/0904.2282
dc.identifierhttp://arxiv.org/abs/0904.2282
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/227083
dc.subjectCombinatorics
dc.subject05C15; 05C83
dc.titleGraphs with bounded tree-width and large odd-girth are almost bipartite
dc.typetext

Files

Collections

arXiv