For every strictly 1-balanced graph F, the random graph G(n,p) gets an F-factor exactly at the sharp threshold where F-isolated vertices vanish, confirming Ruciński's conjecture.
Spanning-cycles in random graphs.Combinatorics, Probability and Computing, 32(5):833–850, 2023
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sharp Thresholds for Factors in Random Graphs
For every strictly 1-balanced graph F, the random graph G(n,p) gets an F-factor exactly at the sharp threshold where F-isolated vertices vanish, confirming Ruciński's conjecture.