Papers
Topics
Authors
Recent
Search
2000 character limit reached

Perfect matching covers of claw-free cubic graphs

Published 1 Oct 2026 in math.CO | (2610.01137v1)

Abstract: The Berge conjecture [Proc. London Math. Soc., 1979] asserts that every bridgeless cubic graph can be covered by five perfect matchings. The 5-cycle double cover conjecture, proposed independently by Preissmann (1981) and Celmins (1984), asserts that every bridgeless graph admits five even subgraphs such that every edge belongs to exactly two of them. Hakobyan and Mkrtchyan [Ars Math. Contemp., 2019] proved that the 5-cycle double cover conjecture holds if and only if every bridgeless claw-free cubic graph can be covered by four perfect matchings. In this paper, we prove that the Berge conjecture holds for bridgeless claw-free cubic graphs. Moreover, we show that every bridgeless claw-free cubic graph GG admits four perfect matchings that cover at least 299315∣E(G)∣\frac{299}{315}|E(G)| edges.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.