arXiv · 2611.16160
Contiguity of unions of perfect matchings and random regular uniform hypergraphs
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Alan Frieze, Xavier Pérez-Giménez. 2026-11-12. Contiguity of unions of perfect matchings and random regular uniform hypergraphs. https://searcharxiv.com/abs/2611.16160
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.