Counting matchings in near-regular hypergraphs: Glock-Joos-Kim-Kühn-Lichev, Theorem 3.5 without conflicts
Source: github.com/jtraverso/gjkkl-matching-count/tree/2d51367b7777…
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,…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-19-000008
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000008/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000008/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'