On fractional K‐factors of random graphs

DOI10.1002/rsa.20144zbMath1120.05082OpenAlexW4250033301MaRDI QIDQ5297135

Michael Krivelevich, Simi Haber

Publication date: 18 July 2007

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20144

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Perfect fractional matchings in \(k\)-out hypergraphs ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Corrigendum: On fractional K-factors of random graphs

Cites Work

• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• Threshold functions for extension statements
• Counting extensions
• Threshold Functions for H-factors

This page was built for publication: On fractional K‐factors of random graphs