Determines the threshold number of random edges to add to a dense graph to guarantee the asymmetric vertex-Ramsey property for any r and any graph tuple with high probability.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
There exists K such that any n-vertex d-regular γ-expander with d ≥ (γ^{-1} log n)^K is Hamiltonian if bipartite or γ-far from bipartite.
citing papers explorer
-
The threshold for the asymmetric vertex-Ramsey property in randomly perturbed graphs
Determines the threshold number of random edges to add to a dense graph to guarantee the asymmetric vertex-Ramsey property for any r and any graph tuple with high probability.
-
Hamiltonicity of regular sublinear expanders
There exists K such that any n-vertex d-regular γ-expander with d ≥ (γ^{-1} log n)^K is Hamiltonian if bipartite or γ-far from bipartite.