1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.CO2026★ 1 cited
Entropy Bounds for Perfect Matchings in Bipartite Hypergraphs
Tantan Dai, Alexander Divoux, Tom Kelly
A hypergraph is \textit{bipartite with bipartition } if every edge has exactly one vertex in , and a matching in such a hypergraph is \textit{-perfect} if it saturate…
math.CO2025
On the existence of reflecting -queens configurations
Tantan Dai, Tom Kelly
In 1967, Klarner proposed a problem concerning the existence of reflecting -queens configurations. The problem considers the feasibility of placing mutually non-attacking qu…