Recent Comments
Tag Archives: Richard Montgomery
Richard Montgomery presents: A proof of the Ryser-Brualdi-Stein conjecture for large even n
Fresh from the ArXiv A proof of the Ryser-Brualdi-Stein conjecture for large even n by Richard Montgomery A Latin square of order n is an n by n grid filled using n symbols so that each symbol appears exactly once … Continue reading
Posted in Combinatorics, Updates
Tagged Herbert Ryser, Richard Brualdi, Richard Montgomery, Sherman Stein
1 Comment
Ringel Conjecture, Solved! Congratulations to Richard Montgomery, Alexey Pokrovskiy, and Benny Sudakov
Ringel’s conjecture solved (for sufficiently large n) A couple weeks ago and a few days after I heard an excellent lecture about it by Alexey Pokrovskiy in Oberwolfach, the paper A proof of Ringel’s Conjecture by Richard Montgomery, Alexey Pokrovskiy, … Continue reading
Posted in Combinatorics, Open problems, Updates
Tagged Alexey Pokrovskiy, Benny Sudakov, Richard Montgomery
5 Comments
Combinatorics and more 