English

Ramsey properties of randomly perturbed hypergraphs

Combinatorics 2025-02-21 v2

Abstract

We study Ramsey properties of randomly perturbed 33-uniform hypergraphs. For~t2t\geq 2, write K~t(3)\tilde K^{(3)}_t to denote the 33-uniform {\it expanded} clique hypergraph obtained from the complete graph KtK_t by expanding each of the edges of the latter with a new additional vertex. For an even integer t4t\geq 4, let~MM denote the asymmetric maximal density of the pair (K~t(3),K~t/2(3))(\tilde K^{(3)}_t,\tilde K^{(3)}_{t/2}). We prove that adding a set~FF of random hyperedges satisfying Fn31/M|F|\gg n^{3-1/M} to a given nn-vertex 33-uniform hypergraph~HH with non-vanishing edge density asymptotically almost surely results in a perturbed hypergraph enjoying the Ramsey property for K~t(3)\tilde K^{(3)}_t and two colours. We conjecture that this result is asymptotically best possible with respect to the size of FF whenever t6t\geq 6 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

R2 v1 2026-06-28T13:10:24.144Z