A proof of the Ryser-Brualdi-Stein conjecture for large even $n$

Complete mappings of finite groups

M. Hall and L. J. Paige · 1955

Earlier work this paper cites.

Neuere Probleme der Kombinatorik

H. Ryser · 1967

Earlier work this paper cites.

A lower bound for the order of a partial transversal in a Latin square

K. K. Koksma · 1969

Earlier work this paper cites.

Transversals of Latin squares and their generalizations

S. K. Stein · 1975

Earlier work this paper cites.

Maximal sets of Latin squares and partial transversals

D. A. Drake · 1977

Earlier work this paper cites.

A lower bound for the length of partial transversals in a Latin square

A. E. Brouwer, A. de Vries, and R. Wieringa · 1978

Earlier work this paper cites.

A note on partial parallel classes in Steiner systems

C. C. Lindner and K. T. Phelps · 1978

Earlier work this paper cites.

On self-orthogonal Latin squares and partial transversals of Latin squares

S. P. Wang · 1978

Earlier work this paper cites.

An n × n n\times n Latin square has a transversal with at least n − n n-\sqrt{n} distinct symbols

D. E. Woolbright · 1978

Earlier work this paper cites.

On the size of a maximum transversal in a Steiner triple system

A. E. Brouwer · 1981

Earlier work this paper cites.

A lower bound for the length of a partial transversal in a Latin square

P. W. Shor · 1982

Earlier work this paper cites.

Near perfect coverings in graphs and hypergraphs

P. Frankl and V. Rödl · 1985

Earlier work this paper cites.

On a packing and covering problem

V. Rödl · 1985

Earlier work this paper cites.

Hamilton circuits with many colours in properly edge-coloured complete graphs

L. D. Andersen · 1989

Earlier work this paper cites.

Combinatorial matrix theory

R. A. Brualdi and H. J. Ryser · 1991

Earlier work this paper cites.

Vertex coverings by monochromatic cycles and trees

P. Erdős, A. Gyárfás, and L. Pyber · 1991

Earlier work this paper cites.

Colorings of block designs,

C. J. Colbourn and A. Rosa · 1992

Earlier work this paper cites.

Topological cliques in graphs

J. Komlós and E. Szemerédi · 1994

Earlier work this paper cites.

Topological cliques in graphs II

J. Komlós and E. Szemerédi · 1996

Cited alongside, same era.

Nearly perfect matchings in regular simple hypergraphs

N. Alon, J.-H. Kim, and J. Spencer · 1997

Cited alongside, same era.

Triangle factors in random graphs

M. Krivelevich · 1997

Cited alongside, same era.

Transversals and multicolored matchings

S. Akbari and A. Alipour · 2004

Cited alongside, same era.

A Dirac-type theorem for 3-uniform hypergraphs

V. Rödl, A. Ruciński, and E. Szemerédi · 2006

Cited alongside, same era.

Edge colouring with delays

N. Alon and V. Asodi · 2007

Cited alongside, same era.

A lower bound for the length of a partial transversal in a Latin square

Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs

J. Balogh and T. Molla · 2019

Later among the works it cites.

Spanning trees in random graphs

R. Montgomery · 2019

Later among the works it cites.

Decompositions into spanning rainbow structures

R. Montgomery, A. Pokrovskiy, and B. Sudakov · 2019

Later among the works it cites.

On the number of symbols that forces a transversal

P. Keevash and L. Yepremyan · 2020

Later among the works it cites.

Almost all Steiner triple systems have perfect matchings

M. Kwan · 2020

Later among the works it cites.

Small Latin arrays have a near transversal

D. Best, K. Pula, and I. M. Wanless · 2021

Later among the works it cites.