Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
166 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On two consequences of Berge-Fulkerson conjecture (1805.06828v1)

Published 17 May 2018 in cs.DM and math.CO

Abstract: The classical Berge-Fulkerson conjecture states that any bridgeless cubic graph $G$ admits a list of six perfect matchings such that each edge of $G$ belongs to two of the perfect matchings from the list. In this short note, we discuss two statements that are consequences of this conjecture. We show that the first statement is equivalent to Fan-Raspaud conjecture. We also show that the smallest counter-example to the second one is a cyclically $4$-edge-connected cubic graph.

Citations (3)

Summary

We haven't generated a summary for this paper yet.