EUVIMEDOpdag EUVIMED
Crossref

Entropy Bounds for Perfect Matchings in Bipartite Hypergraphs

Tantan Dai, Alexander Divoux, Tom Kelly

The Electronic Journal of Combinatorics · 2026-04-24 · 33 (2)

DOI: 10.37236/14339 ↗

At a glance

Journal article in The Electronic Journal of Combinatorics, published online on 2026-04-24. Written by Tantan Dai and 2 co-authors. Cited 1 times so far (Crossref).

AbstractBibliografiske oplysningerCiteRelated studies

Abstract (original language)

A hypergraph is bipartite with bipartition $(A, B)$ if every edge has exactly one vertex in $A$, and a matching in such a hypergraph is $A$-perfect if it saturates every vertex in $A$. We prove an upper bound on the number of $A$-perfect matchings in uniform hypergraphs with small maximum codegree. Using this result, we prove that there exist order-$n$ Latin squares with at most $(n/e^{2.117})^n$ transversals when $n$ is odd and $n \equiv 0 \pmod 3$. We also show that $k$-uniform $D$-regular hypergraphs on $n$ vertices have at most $((1+o(1))q/e^k)^{Dn/k}$ proper $q$-edge-colorings when $q = (1+o(1))D$ and the maximum codegree is $o(q)$.

Cite

APA

Dai, T., Divoux, A., & Kelly, T. (2026). Entropy Bounds for Perfect Matchings in Bipartite Hypergraphs. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/14339

Vancouver

Dai T, Divoux A, Kelly T. Entropy Bounds for Perfect Matchings in Bipartite Hypergraphs. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/14339

BibTeX
@article{Dai2026,
  author = {Dai, Tantan and Divoux, Alexander and Kelly, Tom},
  title = {Entropy Bounds for Perfect Matchings in Bipartite Hypergraphs},
  journal = {The Electronic Journal of Combinatorics},
  year = {2026},
  volume = {33},
  number = {2},
  doi = {10.37236/14339}
}
Start for free →