{"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","summary":"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,…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-19","reactions":{},"formalized":true,"formalizes":[{"title":"Conflict-free hypergraph matchings","identifier":"arxiv:2205.05564","relationship":"adapts"}]}