Fulkerson's six-perfect-matching conjecture for bridgeless cubic graphs
Let be a bridgeless cubic graph. A Fulkerson cover is a list of six perfect matchings of in which every edge is contained in exactly two matchings. Fulkerson's conjecture. Every bridgeless cubic graph admits a Fulkerson cover. This conjecture is also widely known as the Berge--Fulkerson Conjecture and remains open.
References
Primary source
František Kardoš, Edita Máčajová and Jean Paul Zerafa, “Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching”, arXiv:2204.10021 (2022).
Additional references
2 papers in this index state this conjecture (2016–2022). The statement above is taken from the most recent of them; the others are arXiv:1601.03248.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.