On one-factorizations of the complete graph (Q1089356): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q114215637, #quickstatements; #temporary_batch_1711574657256 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114215637 / rank | |||
Normal rank | |||
Revision as of 00:01, 28 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On one-factorizations of the complete graph |
scientific article |
Statements
On one-factorizations of the complete graph (English)
0 references
1987
0 references
Every one-factorization of the complete graph on n vertices contains k one-factors whose union is connected and \(k\leq^ 2\log n\). This was conjectured by L. Babai and P. Erdős.
0 references
one-factorization
0 references
complete graph
0 references
