Alexander Divoux

activity

20232026

most citedSubsquares in random Latin squares and rectangles

2 citations · 3 across the 6 of their papers we have counts for

collaborators

Showing 2025 · math.COShow all

2 papers · 2 filters

math.CO2025

Asymptotic structure. V. The coarse Menger conjecture in bounded path-width

Alex Divoux, Tung Nguyen, Alex Scott +1

Menger's theorem tells us that if $S, T$ are sets of vertices in a graph $G$ , then (for $k \geq 0$ ) either there are $k + 1$ vertex-disjoint paths between $S$ and $T$ , or there is a set…

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 $(A, B)$ } if every edge has exactly one vertex in $A$ , and a matching in such a hypergraph is \textit{ $A$ -perfect} if it saturate…