2 citations · 3 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2025★ 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.CO2024
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…
math.CO2023★ 2 cited
Subsquares in random Latin squares and rectangles
Alexander Divoux, Tom Kelly, Camille Kennedy +1
A partial Latin rectangle is \textit{-sparse} if the number of nonempty entries in each row and column is at most and each symbol is used at most times. We…