Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs (Q5419939): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:20, 9 February 2024
scientific article; zbMATH DE number 6302961
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs |
scientific article; zbMATH DE number 6302961 |
Statements
Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs (English)
0 references
11 June 2014
0 references
decision problem
0 references
