Edmonds' matching polytope theorem
GPTKB entity
Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite undirected graphs
|
| gptkbp:characterizedBy |
gptkb:matching_polytope
|
| gptkbp:describes |
convex hull of incidence vectors of matchings in a graph
|
| gptkbp:field |
combinatorial optimization
graph theory polyhedral combinatorics |
| gptkbp:hasApplication |
linear programming
combinatorial optimization algorithms |
| https://www.w3.org/2000/01/rdf-schema#label |
Edmonds' matching polytope theorem
|
| gptkbp:namedAfter |
gptkb:Jack_Edmonds
|
| gptkbp:publishedIn |
gptkb:Canadian_Journal_of_Mathematics
Maximum matching and a polyhedron with 0,1-vertices |
| gptkbp:relatedTo |
gptkb:Edmonds'_blossom_algorithm
polytope theory matching problem |
| gptkbp:state |
the matching polytope of a graph is described by certain linear inequalities
|
| gptkbp:yearProposed |
1965
|
| gptkbp:bfsParent |
gptkb:matching_polytope
|
| gptkbp:bfsLayer |
7
|