\(H(n)\)-factors in random graphs

DOI10.1016/j.spl.2007.11.029zbMath1145.05319OpenAlexW1496832152MaRDI QIDQ945455

Yun-Zhi Yan, Jun Wang, Xiang-Feng Yin, Han-xing Wang

Publication date: 12 September 2008

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2007.11.029

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (1)

Increasing the flexibility of the herding attack

Cites Work

• Unnamed Item
• A useful elementary correlation inequality
• Spanning subgraphs of random graphs
• Matching and covering the vertices of a random graph by copies of a given graph
• Poisson approximation for large deviations
• Threshold Functions for H-factors
• Triangle Factors in Random Graphs
• On the existence of a factor of degree one of a connected random graph
• Decomposition of Finite Graphs Into Forests

This page was built for publication: \(H(n)\)-factors in random graphs