Metraipolis › archive › dc_720e48909d9f

Clique-factors in randomly perturbed hypergraphs — arXiv:2610.41340

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41340
License (as archived)
CC0-1.0
Archived
2026-11-03T08:18:28.482Z
SHA-256 of the archived text
c66d72d14884fdae1a021b774404fea39360e6beb72e2ab5d54a71016c859f49
Stable URL of this page
https://metraipolis.com/documento/dc_720e48909d9f

How to cite

Clique-factors in randomly perturbed hypergraphs — arXiv:2610.41340 — arXiv (en), https://arxiv.org/abs/2610.41340 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_720e48909d9f (Metraipolis archive dc_720e48909d9f, sha256 c66d72d14884fdae1a021b774404fea39360e6beb72e2ab5d54a71016c859f49)
BibTeX
@misc{dc720e48909d9f,
  title = {Clique-factors in randomly perturbed hypergraphs — arXiv:2610.41340},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41340},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_720e48909d9f; sha256 c66d72d14884fdae1a021b774404fea39360e6beb72e2ab5d54a71016c859f49},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41340. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this paper we establish the following result for clique-factors in randomly perturbed hypergraphs when the cliques are large enough. For integers $k \geq 3$ and $t\geq t_0(k)$, we show that for every $\alpha> 0$, there exists $C>0$ such that for sufficiently large $n\in(t+1)\mathbb{N}$, the union of a $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $\alpha n$ and a binomial random $k$-uniform hypergraph $H^{(k)}(n,p)$ with $p\geq Cn^{-{t/\binom{t+1}{k}}}$ on the same vertex set contains a $K_{t+1}^{(k)}$-factor asymptotically almost surely. The bound on $p$ is asymptotically best possible and extends the graph case, resolved by Balogh, Treglown and Wagner. In particular, we have $t_0(3)=3$, which implies that our result applies to every $t\ge 3$ for $3$-uniform hypergraphs. Together with the previously established result for perfect matchings, this covers all possible clique sizes for $3$-uniform hypergraphs.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.41340 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T08:05:23.774Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).