Entropy-based upper bounds on A-perfect matchings in uniform bipartite hypergraphs with bounded codegree yield (n/e^{2.117})^n transversals for odd-order Latin squares with n ≡ 0 mod 3 and ((1+o(1))q/e^k)^{Dn/k} proper q-edge-colorings for k-uniform D-regular hypergraphs with q ≈ D and small codeg
Keevash, Counting designs, J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Entropy Bounds for Perfect Matchings in Bipartite Hypergraphs
Entropy-based upper bounds on A-perfect matchings in uniform bipartite hypergraphs with bounded codegree yield (n/e^{2.117})^n transversals for odd-order Latin squares with n ≡ 0 mod 3 and ((1+o(1))q/e^k)^{Dn/k} proper q-edge-colorings for k-uniform D-regular hypergraphs with q ≈ D and small codeg