{
  "abstract": "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 $α> 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 $α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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.41340",
  "author_total": 4,
  "authors": [
    {
      "name": "Yulin Chang"
    },
    {
      "name": "Jie Han"
    },
    {
      "name": "Patrick Morris"
    },
    {
      "name": "Lin Sun"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/0f0q63sebg08c.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.41340",
  "fulltext_url": null,
  "id": "0f0q63sebg08c",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.41340",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.CO"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://arxiv.org/pdf/2610.41340",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-30",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/0f0q63sebg08c.ris",
  "sources": [
    {
      "first_seen": "2026-11-02T12:21:20Z",
      "native_id": "2610.41340",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.41340"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Clique-factors in randomly perturbed hypergraphs",
  "title_text": "Clique-factors in randomly perturbed hypergraphs",
  "type": "preprint",
  "updated_at": "2026-11-04T15:20:52Z",
  "url": "https://research.draconitic.com/paper/0f0q63sebg08c",
  "venue": "arXiv",
  "versions": []
}