Proof of a theorem of Tutte using permanents

DOI10.1016/J.ENDM.2013.11.017MaRDI QIDQ277516zbMATH OpenOpenAlexFDO

Authors M. Aghabali

Publication date 29 April 2016

Full work available at URL https://doi.org/10.1016/j.endm.2013.11.017

zbMATH Keywords

permanent\(\{1, 2\}\)-factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Note: a short proof of a theorem of Tutte
• A generalization of Tutte's 1-factor theorem to countable graphs
• A Simple Criterion for a Graph to have a Perfect Matching
• Generalizing Tutte's theorem and maximal non-matchable graphs
• A proof of the equivalence of Tutte's theorem and Tutte-Berge's formula

Cites work

• Permanents
• The 1-Factors of Oriented Graphs

Cited in

(3)

• Note: a short proof of a theorem of Tutte
• Proof of the Monotone Column Permanent Conjecture
• A proof of the equivalence of Tutte's theorem and Tutte-Berge's formula

This page was built for publication: Proof of a theorem of Tutte using permanents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q277516)