A counterexample to Stein’s Equi-$n$-square Conjecture

DOI10.1090/proc/14220zbMath1411.05041arXiv1711.00429OpenAlexW2963962936WikidataQ122999546 ScholiaQ122999546MaRDI QIDQ5377048

Alexey Pokrovskiy, Benjamin Sudakov

Publication date: 23 May 2019

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.00429

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Transversal (matching) theory (05D15)

Related Items (7)

New bounds for Ryser’s conjecture and related problems ⋮ Almost all optimally coloured complete graphs contain a rainbow Hamilton path ⋮ Almost fair perfect matchings in complete bipartite graphs ⋮ Balanced equi-\(n\)-squares ⋮ Rainbow structures in locally bounded colorings of graphs ⋮ Repeated Patterns in Proper Colorings ⋮ Graph theory. Abstracts from the workshop held January 6--12, 2019

Cites Work

• Unnamed Item
• Unnamed Item
• Lopsided Lovász Local lemma and Latin transversals
• Research problem 40
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• Transversals of latin squares and their generalizations
• Covering with Latin transversals
• On a conjecture of Stein
• Fair Representation by Independent Sets
• Decompositions into spanning rainbow structures
• Combinatorial Matrix Theory
• Multipartite hypergraphs achieving equality in Ryser's conjecture

This page was built for publication: A counterexample to Stein’s Equi-$n$-square Conjecture