On one-factorizations of the complete graph

DOI10.1016/0012-365X(87)90030-6MaRDI QIDQ1089356zbMATH OpenOpenAlexWikidataFDO

Authors Laszló Pyber

Publication date 1987

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(87)90030-6

zbMATH Keywords

complete graphone-factorization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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.

Cited in

(15)

• Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three
• On 1-factorizability of Cayley graphs
• A note on two orthogonal totally \(C_4\)-free one-factorizations of complete graphs
• Unextendible product bases and 1-factorization of complete graphs
• On perfectly one–factorable cubic graphs
• scientific article; zbMATH DE number 5155854 (Why is no real title available?)
• One-factorizations of the complete graph—A survey
• On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups
• scientific article; zbMATH DE number 124525 (Why is no real title available?)
• Switching in one-factorisations of complete graphs
• scientific article; zbMATH DE number 4123777 (Why is no real title available?)
• scientific article; zbMATH DE number 1287820 (Why is no real title available?)
• One-Factorizations of Complete Graphs with a Doubly Transitive Automorphism Group
• scientific article; zbMATH DE number 6843209 (Why is no real title available?)
• scientific article; zbMATH DE number 812037 (Why is no real title available?)

This page was built for publication: On one-factorizations of the complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089356)