Long Cycles, Heavy Cycles and Cycle Decompositions in Digraphs

DOI10.1016/J.JCTB.2020.12.008MaRDI QIDQ6329413arXivFDO

Authors Charlotte Knierim, Maxime Larcher, Anders Martinsson, Andreas Noever

Publication date 18 November 2019

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.JCTB.2020.12.008

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random walks on graphs (05C81)

arXiv classification

math.COmath.PR

Abstract: Haj'os conjectured in 1968 that every Eulerian (n)-vertex graph can be decomposed into at most $lfloor(n-1)/2floor$ edge-disjoint cycles. This has been confirmed for some special graph classes, but the general case remains open. In a sequence of papers by Bienia and Meyniel (1986), Dean (1986), and Bollob'as and Scott (1996) it was analogously conjectured that every emph{directed} Eulerian graph can be decomposed into $O(n)$ cycles. In this paper, we show that every directed Eulerian graph can be decomposed into $O(nlogDelta)$ disjoint cycles, thus making progress towards the conjecture by Bollob'as and Scott. Our approach is based on finding heavy cycles in certain edge-weightings of directed graphs. As a further consequence of our techniques, we prove that for every edge-weighted digraph in which every vertex has out-weight at least $1$, there exists a cycle with weight at least $Omega(loglogn/logn)$, thus resolving a question by Bollob'as and Scott.

Cited in

(1)

• scientific article; zbMATH DE number 5139445 (Why is no real title available?)

This page was built for publication: Long Cycles, Heavy Cycles and Cycle Decompositions in Digraphs

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