Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejc.2011.02.001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJC.2011.02.001 / rank | |||
Normal rank | |||
Revision as of 05:58, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees |
scientific article |
Statements
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (English)
0 references
24 October 2011
0 references
Hamilton cycles
0 references
\(k\)-uniform hypergraph
0 references
0 references
