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
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.CO 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
Constructs stable non-r-partite r-graphs F disproving Mubayi's local supersaturation conjecture by an arbitrary constant factor K in every uniformity.
For any graph H there exists C(H) such that every sufficiently large n-vertex graph with d(x)+d(y) ≥ 2(1−1/χ_cr(H))n for every non-edge xy contains an H-tiling covering all but at most C(H) vertices.
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.
-
Strong counterexamples to Mubayi's supersaturation conjecture in every uniformity
Constructs stable non-r-partite r-graphs F disproving Mubayi's local supersaturation conjecture by an arbitrary constant factor K in every uniformity.
-
An Ore-type condition for $H$-tilings in graphs
For any graph H there exists C(H) such that every sufficiently large n-vertex graph with d(x)+d(y) ≥ 2(1−1/χ_cr(H))n for every non-edge xy contains an H-tiling covering all but at most C(H) vertices.