On one-factorizations of the complete graph (Q1089356)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4004223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On one-factorizations of the complete graph |
scientific article; zbMATH DE number 4004223 |
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
