Long cycles, heavy cycles and cycle decompositions in digraphs
METADATA ONLY
Loading...
Author / Producer
Date
2021-05
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
Hajós conjectured in 1968 that every Eulerian n-vertex graph can be decomposed into at most ⌊(n−1)/2⌋ 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) [1], Dean (1986) [7], and Bollobás and Scott (1996) [2] it was analogously conjectured that every 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(nlogΔ) disjoint cycles, thus making progress towards the conjecture by Bollobás 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 Ω(loglogn/logn), thus resolving a question by Bollobás and Scott.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
148
Pages / Article No.
125 - 148
Publisher
Elsevier
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
03672 - Steger, Angelika (emeritus) / Steger, Angelika (emeritus)