Ramsey properties of randomly perturbed hypergraphs
Abstract
We study Ramsey properties of randomly perturbed -uniform hypergraphs. For~, write to denote the -uniform {\it expanded} clique hypergraph obtained from the complete graph by expanding each of the edges of the latter with a new additional vertex. For an even integer , let~ denote the asymmetric maximal density of the pair . We prove that adding a set~ of random hyperedges satisfying to a given -vertex -uniform hypergraph~ with non-vanishing edge density asymptotically almost surely results in a perturbed hypergraph enjoying the Ramsey property for and two colours. We conjecture that this result is asymptotically best possible with respect to the size of whenever is even. The key tools of our proof are a new variant of the hypergraph regularity lemma accompanied with a \emph{tuple lemma} providing appropriate control over joint link graphs. Our variant combines the so called strong and the weak hypergraph regularity lemmata.
Keywords
Cite
@article{arxiv.2311.01750,
title = {Ramsey properties of randomly perturbed hypergraphs},
author = {Elad Aigner-Horev and Dan Hefetz and Mathias Schacht},
journal= {arXiv preprint arXiv:2311.01750},
year = {2025}
}
Comments
47 pages, 1 figure. In this version two proofs are provided for the tuple lemma; a short one employing the hypergraph counting lemma and longer one avoids the counting lemma