Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
gptkb:Polygon |
| gptkbp:citation |
gptkb:Edmonds,_J._(1965)._Paths,_trees,_and_flowers.
|
| gptkbp:definedIn |
graph theory
|
| gptkbp:dimensions |
number of edges in the graph
|
| gptkbp:facetDescription |
gptkb:Edmonds'_matching_polytope_theorem
gptkb:Edmonds'_characterization_(1971) |
| gptkbp:facetInequalities |
blossom inequalities
degree constraints non-negativity constraints |
| gptkbp:introduced |
gptkb:Jack_Edmonds
|
| gptkbp:relatedTo |
gptkb:bipartite_graph
gptkb:matching_polytope gptkb:Edmonds'_blossom_algorithm perfect matching non-bipartite graph linear programming relaxation |
| gptkbp:usedIn |
combinatorial optimization
polyhedral combinatorics integer programming |
| gptkbp:verticesCorrespondTo |
perfect matchings of a graph
|
| gptkbp:bfsParent |
gptkb:matching_polytope
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
perfect matching polytope
|