Polynomial-time perfect matchings in dense hypergraphs (Q5495801): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q57255183, #quickstatements; #temporary_batch_1703769339033 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57255183 / rank | |||
Normal rank | |||
Revision as of 14:28, 28 December 2023
scientific article; zbMATH DE number 6326965
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time perfect matchings in dense hypergraphs |
scientific article; zbMATH DE number 6326965 |
Statements
Polynomial-time perfect matchings in dense hypergraphs (English)
0 references
7 August 2014
0 references
lattices
0 references
perfect matchings
0 references
