Abstract
Let H be a graph on h vertices, and G be a graph on n vertices. An H-factor of G is a spanning subgraph of G consisting of n/h vertex disjoint copies of H. The fractional arboricity of H is , where the maximum is taken over all subgraphs (V′, E′) of H with |V′| > 1. Let δ(H) denote the minimum degree of a vertex of H. It is shown that if δ(H) < a(H), then n−1/a(H) is a sharp threshold function for the property that the random graph G(n, p) contains an H-factor. That is, there are two positive constants c and C so that for p(n) = cn−1/a(H) almost surely G(n, p(n)) does not have an H-factor, whereas for p(n) = Cn−1/a(H), almost surely G(n, p(n)) contains an H-factor (provided h divides n). A special case of this answers a problem of Erdős.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Cycle Saturation in Random Graphs;SIAM Journal on Discrete Mathematics;2023-07-10
2. The hitting time of clique factors;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
3. Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors;Random Structures & Algorithms;2022-07-22
4. Fairest edge usage and minimum expected overlap for random spanning trees;Discrete Mathematics;2021-05
5. Probability and Statistics;Landscape of 21st Century Mathematics;2021