Id: palomar/PALOMAR-2026-11-19-000008 Url: https://github.com/jtraverso/gjkkl-matching-count/tree/2d51367b7777a669de247e10b5e93229c8e06f1c Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-19-000008-v1.json Repo: https://github.com/jtraverso/gjkkl-matching-count Tags: math.CO, math.PR, msc:05C65, msc:05C70, msc:05D40, msc:60G42 Score: 0 Title: Counting matchings in near-regular hypergraphs: Glock-Joos-Kim-Kühn-Lichev, Theorem 3.5 without conflicts Trust: high Domain: math.CO Source: palomar Authors: Juan Pablo Traverso Gianini Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-19 Formalized: true Formalizes: title=Conflict-free hypergraph matchings identifier=arxiv:2205.05564 relationship=adapts Page: https://delphi.science/r/palomar/PALOMAR-2026-11-19-000008 A lower bound for the number of matchings of a given size in an almost regular uniform hypergraph with small codegrees. For every k >= 2 there is eps_0 > 0 such that for every eps in (0, eps_0) there is d_0 such that, for all d >= d_0, every k-uniform hypergraph H on n <= exp(d^{eps^3}) vertices with (1 - d^{-eps}) d <= delta(H) <= Delta(H) <= d and codegrees at most d^{1-eps} has, for every natural number m <= (1 - d^{-eps^3}) n / k, at least ((1 - d^{-eps^4}) d / e^{k-1})^m matchings with m edges. This is Theorem 3.5 of Glock, Joos, Kim, Kühn and Lichev, Conflict-free hypergraph matchings,…