Home » Subject » Graph Theory » Basic G.T.

Matchings


Graph Theory » Basic G.T. » Matchings

The Berge-Fulkerson conjecture ★★★★

Author(s): Berge; Fulkerson

Conjecture   If $ G $ is a bridgeless cubic graph, then there exist 6 perfect matchings $ M_1,\ldots,M_6 $ of $ G $ with the property that every edge of $ G $ is contained in exactly two of $ M_1,\ldots,M_6 $.

Keywords: cubic; perfect matching

Posted by mdevos
updated November 23rd, 2011
9 comments
Graph Theory » Basic G.T. » Matchings

The intersection of two perfect matchings ★★

Author(s): Macajova; Skoviera

Conjecture   Every bridgeless cubic graph has two perfect matchings $ M_1 $, $ M_2 $ so that $ M_1 \cap M_2 $ does not contain an odd edge-cut.

Keywords: cubic; nowhere-zero flow; perfect matching

Posted by mdevos
updated August 30th, 2007
add new comment
Graph Theory » Basic G.T. » Matchings

Matchings extend to Hamiltonian cycles in hypercubes ★★

Author(s): Ruskey; Savage

Question   Does every matching of hypercube extend to a Hamiltonian cycle?

Keywords: Hamiltonian cycle; hypercube; matching

Posted by Jirka
updated September 28th, 2007
add new comment
Graph Theory » Basic G.T. » Matchings

Random stable roommates ★★

Author(s): Mertens

Conjecture   The probability that a random instance of the stable roommates problem on $ n \in 2{\mathbb N} $ people admits a solution is $ \Theta( n ^{-1/4} ) $.

Keywords: stable marriage; stable roommates

Posted by mdevos
updated February 26th, 2008
add new comment

Note: Resolved problems from this section may be found in Solved problems.


Syndicate content