Contiguity of unions of perfect matchings and random regular uniform hypergraphs

For fixed integers $s\ge3$ and $r$ satisfying $\log(r!)>\frac{r(s-1)}s\log r$, the union of $r$ independent uniform perfect matchings of the complete $s$-uniform hypergraph is mutually contiguous to the uniform simple $r$-regular $s$-uniform hypergraph, as $n\to\infty$ through multiples of $s$. In particular, $r=\lceil e^s\rceil$ suffices. The main input is the sharp entropy inequality for random permutations of Bristiel and Caputo. It proves the global maximization needed for the second moment of the number of complete factorizations. The remaining calculation, including its lattice factor, matches the short-cycle contribution required by small-subgraph conditioning.\\ This is an expanded version of a proof provided by ChatGPT-Astra.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16160
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Contiguity of unions of perfect matchings and random regular uniform hypergraphs

Xavier Pérez‐Giménez, ALAN M. FRIEZE
arXiv (Cornell University)
Limits and Structures in Graph Theory
preprint

Contiguity of unions of perfect matchings and random regular uniform hypergraphs

Xavier Pérez‐Giménez, ALAN M. FRIEZE
preprint en

Abstract

For fixed integers $s\ge3$ and $r$ satisfying $\log(r!)>\frac{r(s-1)}s\log r$, the union of $r$ independent uniform perfect matchings of the complete $s$-uniform hypergraph is mutually contiguous to the uniform simple $r$-regular $s$-uniform hypergraph, as $n\to\infty$ through multiples of $s$. In particular, $r=\lceil e^s\rceil$ suffices. The main input is the sharp entropy inequality for random permutations of Bristiel and Caputo. It proves the global maximization needed for the second moment of the number of complete factorizations. The remaining calculation, including its lattice factor, matches the short-cycle contribution required by small-subgraph conditioning.\\ This is an expanded version of a proof provided by ChatGPT-Astra.

arXiv (Cornell University)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon