On the existence of factors intersecting sets of cycles in regular graphs
Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo, Jarne Renders, Luca Toffanetti, Isaak H. Wolf

TL;DR
This paper investigates conditions under which regular graphs contain factors intersecting all given cycles, generalizing previous results related to the Berge-Fulkerson conjecture and establishing necessary and sufficient conditions involving graph connectivity and ratio of factors.
Contribution
It establishes necessary and sufficient conditions for the existence of factors intersecting all cycles in regular graphs, extending prior work on cubic graphs and cycle intersections.
Findings
2-connectedness of the graph is necessary
The ratio t/r ≥ 1/3 is necessary for the existence of such factors
Confirmed sufficiency of the ratio t/r = 1/3 in certain cases
Abstract
A recent result by Kardo\v{s}, M\'a\v{c}ajov\'a and Zerafa [J. Comb. Theory, Ser. B. 160 (2023) 1--14] related to the famous Berge-Fulkerson conjecture implies that given an arbitrary set of odd pairwise edge-disjoint cycles, say , in a bridgeless cubic graph, there exists a -factor intersecting all cycles in in at least one edge. This remarkable result opens up natural generalizations in the case of an -regular graph and a -factor , with and being positive integers. In this paper, we start the study of this problem by proving necessary and sufficient conditions on , and to assure the existence of a suitable for any possible choice of the set . First of all, we show that needs to be -connected. Under this additional assumption, we highlight how the ratio seems to play a crucial role in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Graph Theory Research · Graph Labeling and Dimension Problems
