Polynomial-time perfect matchings in dense hypergraphs (Q5495801): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57255183, #quickstatements; #temporary_batch_1703769339033 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963068836 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:01, 20 March 2024
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
