New bounds for Ryser’s conjecture and related problems

DOI10.1090/btran/92zbMath1490.05269arXiv2005.00526OpenAlexW3022327648WikidataQ113823150 ScholiaQ113823150MaRDI QIDQ5071853

Peter Keevash, Alexey Pokrovskiy, Benjamin Sudakov, Liana Yepremyan

Publication date: 22 April 2022

Published in: Transactions of the American Mathematical Society, Series B (Search for Journal in Brave)

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

zbMATH Keywords

Steiner triple systemLatin squaretransversalLatin arrayrainbow matchingsemi-random method

Mathematics Subject Classification ID

Hypergraphs (05C65) Orthogonal arrays, Latin squares, Room squares (05B15) Transversal (matching) theory (05D15) Triple systems (05B07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (7)

The \(n\)-queens completion problem ⋮ Almost color-balanced perfect matchings in color-balanced complete graphs ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Colorful Matchings ⋮ Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs

Cites Work

• Unnamed Item
• Reduction of the Hall-Paige conjecture to sporadic simple groups.
• On a packing and covering problem
• Near perfect coverings in graphs and hypergraphs
• Transversals of latin squares and their generalizations
• An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
• Maximal sets of Latin squares and partial transversals
• A note on partial parallel classes in Steiner systems
• Nearly perfect matchings in regular simple hypergraphs
• On a conjecture of Stein
• List coloring of random and pseudo-random graphs
• Weighted sums of certain dependent random variables
• Transversals and multicolored matchings
• On the Size of a Maximum Transversal in a Steiner Triple System
• Transversals in Latin Arrays with Many Distinct Symbols
• On the asymmetry of random regular graphs and random graphs
• Decompositions into spanning rainbow structures
• On the number of symbols that forces a transversal
• Transversals in generalized Latin squares
• A counterexample to Stein’s Equi-$n$-square Conjecture
• Combinatorial Matrix Theory
• A lower bound for the order of a partial transversal in a latin square
• Complete mappings of finite groups
• A lower bound for the length of a partial transversal in a Latin square
• A lower bound for the length of a partial transversal in a Latin square
• Graph colouring and the probabilistic method

This page was built for publication: New bounds for Ryser’s conjecture and related problems