On one-factorizations of the complete graph
type: Item
instance of: scholarly article
title: On one-factorizations of the complete graph
zbMATH Open document ID: 0619.05038
DOI: 10.1016/0012-365X(87)90030-6
published in: Discrete Mathematics
publication date: 1987-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 4004223
zbMATH Keywords: one-factorization
zbMATH Keywords: complete graph
author: Laszló Pyber
MaRDI profile type: Publication
Wikidata QID: Q114215637
full work available at URL: 0012-365x(87)90030-6
OpenAlex ID: W2038193281
description: scientific article; zbMATH DE number 4004223