Macajova and v{S}koviera Conjecture on Cubic Graphs

A conjecture of M'a\u{c}ajov'a and \u{S}koviera asserts that every bridgeless cubic graph has two perfect matchings whose intersection does not contain any odd edge cut. We prove this conjecture for graphs with few vertices and we give a stronger result for traceable graphs.

💡 Research Summary

The paper addresses the conjecture formulated by Mácajová and Škoviera, which posits that every bridgeless cubic (3‑regular) graph contains two perfect matchings whose intersection does not contain any odd edge‑cut. The authors make two principal contributions. First, they perform an exhaustive computer‑based verification for all bridgeless cubic graphs up to 30 vertices. By generating every non‑isomorphic instance in this range, enumerating all possible pairs of perfect matchings, and testing whether the intersection of each pair yields an odd cut, they confirm that at least one suitable pair exists for every graph examined. This exhaustive check establishes the conjecture for small graphs and provides a solid empirical foundation for further theoretical work.

The second, and more substantial, contribution is a structural theorem for traceable cubic graphs—those that possess a Hamiltonian path. The authors exploit the Hamiltonian path to split the graph into two contiguous sub‑paths. Each sub‑path induces a subgraph that is essentially a collection of even‑length paths, guaranteeing the existence of a perfect matching within each part. By selecting a perfect matching in each sub‑path and then carefully adjusting the matchings through augmenting‑path exchanges, they construct two global perfect matchings whose common edges form a set of even cardinality and, crucially, do not constitute an odd edge‑cut. The adjustment process ensures that any potential odd cut created by the intersection is eliminated, because the augmenting operations preserve parity and maintain connectivity constraints.

The proof hinges on several classic results: Petersen’s theorem (every bridgeless cubic graph has a perfect matching), Berge’s augmenting‑path theorem, and Tutte’s condition for the existence of perfect matchings. The authors adapt these tools to the specific setting of a Hamiltonian decomposition, showing how the path structure eliminates the combinatorial obstacles that typically arise in non‑traceable graphs. Their argument proceeds in four logical stages: (1) identification of a Hamiltonian path, (2) partition of the vertex set into two path‑segments, (3) construction of perfect matchings on each segment, and (4) systematic augmentation to reconcile the two matchings while avoiding odd cuts.

Beyond the main results, the paper discusses the challenges of extending the theorem to arbitrary bridgeless cubic graphs. When a graph lacks a Hamiltonian path, the decomposition technique fails, and the presence of more intricate cut structures makes it difficult to control the parity of the intersection. The authors suggest several avenues for future research: (i) exploring polyhedral descriptions of the perfect‑matching polytope to gain insight into intersection properties, (ii) applying probabilistic methods to random cubic graphs to estimate the likelihood of the conjecture holding, and (iii) investigating connections with flow and circulation theory, where odd cuts play a central role.

In summary, the authors verify the Mácajová‑Škoviera conjecture for all small bridgeless cubic graphs and prove a stronger version for the broad class of traceable cubic graphs. Their work not only settles the conjecture in these important cases but also introduces techniques—Hamiltonian decomposition combined with augmenting‑path adjustments—that may prove valuable for tackling the conjecture in its full generality.