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
5 Pith papers cite this work, alongside 4 external citations. Polarity classification is still indexing.
5
Pith papers citing it
4
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
math.CO 5verdicts
UNVERDICTED 5roles
background 1polarities
background 1representative 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.
A new palette framework reduces (k-2)-uniform Turán densities of k-graphs to palette-homomorphism problems and yields exact values including (r-1)/r, (r-1)^2/r^2, and (k-1)^k/k^k for various k and r.
Explicit construction of a single 3-graph with infinite stability number, extending the phenomenon from finite forbidden families to the single-forbidden case.
Survey compiling sufficient conditions for transversal m-edge structures in graph systems that extend classical extremal graph theory results, plus conjectures.
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.
-
Uniform Tur\'an densities of $k$-uniform hypergraphs
A new palette framework reduces (k-2)-uniform Turán densities of k-graphs to palette-homomorphism problems and yields exact values including (r-1)/r, (r-1)^2/r^2, and (k-1)^k/k^k for various k and r.
-
A single $3$-graph with infinite stability number
Explicit construction of a single 3-graph with infinite stability number, extending the phenomenon from finite forbidden families to the single-forbidden case.
-
Transversal Structures in Graph Systems: A Survey
Survey compiling sufficient conditions for transversal m-edge structures in graph systems that extend classical extremal graph theory results, plus conjectures.