On one-factorizations of the complete graph (Q1089356): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: László Pyber / rank | |||
| Property / author | |||
| Property / author: László Pyber / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114215637 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(87)90030-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038193281 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:34, 30 July 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
