{"arxiv_id":"2611.17197","title":"Matching statistics in regular hypergraphs and applications","abstract":"For fixed $k\\ge3$, we determine the first sublinear correction to the logarithm of the matching partition function for a class of $n$-vertex $d$-regular $k$-uniform hypergraphs, uniformly for activities in each fixed compact interval of $(0,\\infty)$.Our hypotheses include every regular linear hypergraph of polynomial degree and a class of nonlinear hypergraphs described by higher codegrees and intersection patterns, which we introduce here. The weighted counting estimate implies an averaged version of Kahn's conjecture: under the uniform measure, the expected number of uncovered vertices is $(1+o(1))nd^{-1/k}$, with concentration and large deviations on this scale. The proof combines a novel variant of random greedy counting, based on short stages and regular completions, with a new entropy method that uses intersection patterns to control reconstruction after deleting matching edges.\n  We highlight the following applications. (i) Partial transversals in Latin squares. Every Latin square of order $n$ has $(n/e^2)^n\\exp((3+o(1))n^{2/3})$ partial transversals. Also, almost all partial transversals have $(1+o(1))n^{2/3}$ missing cells.\n  (ii) Linear $3$-uniform hypergraphs. There are $(n/e^2)^{n^2/6}\\exp((1/2+o(1))n^{5/3})$ linear $3$-uniform hypergraphs on $[n]$, and almost all have $n^2/6-(1/6+o(1))n^{5/3}$ edges.\n  (iii) Matroids of fixed rank. For each fixed $r\\ge4$, the number $m(n,r)$ of rank-$r$ matroids on $[n]$ satisfies $\\log m(n,r)=\\frac{n^{r-1}}{r!}(\\log n-r+1)+\\left(\\frac1{(r-1)!}+o(1)\\right)n^{r-1-1/r}$, refining the estimates of van der Hofstad, Pendavingh and van der Pol.","primary_cat":"math.CO","cross_cats":[],"submitted_at":"2026-11-12T18:01:14+00:00","latest_version":1,"source":"arxiv","source_label":"arXiv","source_url":null,"has_pdf":true,"has_source":false,"verdict":"ACCEPT","confidence":"MODERATE","one_line_summary":"For dense regular uniform hypergraphs satisfying new codegree and intersection conditions, the logarithm of the matching partition function is determined up to the first sublinear correction, yielding sharp typical matchings and several enumeration refinements.","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","upvotes":0,"downvotes":0,"pith_score":0,"inbound_count":0,"_links":{"html":"https://pith.science/paper/2611.17197","verdict":"/api/v1/verdicts/2611.17197"}}