Tutte's theorem

GPTKB entity

Statements (18)
Predicate Object
gptkbp:instanceOf gptkb:mathematical_concept
gptkbp:alsoKnownAs gptkb:Tutte's_1-factor_theorem
gptkbp:appliesTo finite undirected graphs
gptkbp:concerns perfect matching
gptkbp:field graph theory
gptkbp:generalizes gptkb:Hall's_marriage_theorem
https://www.w3.org/2000/01/rdf-schema#label Tutte's theorem
gptkbp:namedAfter gptkb:W._T._Tutte
gptkbp:publicationYear 1947
gptkbp:publishedIn gptkb:Canadian_Journal_of_Mathematics
gptkbp:relatedTo gptkb:Hall's_marriage_theorem
gptkb:Petersen's_theorem
gptkbp:state A finite graph has a perfect matching if and only if for every subset S of its vertices, the number of odd components of the graph minus S is at most |S|.
gptkbp:usedIn theoretical computer science
combinatorics
matching theory
gptkbp:bfsParent gptkb:William_Thomas_Tutte
gptkbp:bfsLayer 6