On the maximum number of edges in a hypergraph with a unique perfect matching (Q409380): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On unique \(k\)-factors and unique \([1,k]\)-factors in graphs. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the structure of factorizable graphs. II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3395507 / rank | |||
Normal rank | |||
Latest revision as of 01:22, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the maximum number of edges in a hypergraph with a unique perfect matching |
scientific article |
Statements
On the maximum number of edges in a hypergraph with a unique perfect matching (English)
0 references
13 April 2012
0 references
hypergraph
0 references
perfect matching
0 references
