Richard Montgomery

activity

20232026

most citedA proof of the Ryser-Brualdi-Stein conjecture for large even

n

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

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024★ 1 cited

Almost-full transversals in equi- $n$ -squares

Debsoumya Chakraborti, Micha Christoph, Zach Hunter +2

In 1975, Stein made a wide generalisation of the Ryser-Brualdi-Stein conjecture on transversals in Latin squares, conjecturing that every equi- $n$ -square (an $n \times n$ array fill…

math.CO2024

Packing the largest trees in the tree packing conjecture

Barnabás Janzer, Richard Montgomery

The famous tree packing conjecture of Gyárfás from 1976 says that any sequence of trees $T_{1}, \dots, T_{n}$ such that $∣ T_{i} ∣ = i$ for each $i \in [n]$ packs into the complete $n$ -vertex…

Almost-full transversals in equi-n-squares

Packing the largest trees in the tree packing conjecture

Almost-full transversals in equi- $n$ -squares