Pages that link to "Item:Q5071853"

The following pages link to New bounds for Ryser’s conjecture and related problems (Q5071853):

Displaying 21 items.

• On the length of a partial independent transversal in a matroidal Latin square (Q426878) (← links)
• The best bounds in a theorem of Russell Lyons (Q1272305) (← links)
• New bounds on Simonyi's conjecture (Q1746583) (← links)
• The \(n\)-queens completion problem (Q2157925) (← links)
• New bounds in Balog-Szemerédi-Gowers theorem (Q2400084) (← links)
• Transversals of Latin squares and covering radius of sets of permutations (Q2509702) (← links)
• Almost color-balanced perfect matchings in color-balanced complete graphs (Q2666593) (← links)
• Transversals and multicolored matchings (Q3156925) (← links)
• Almost all Steiner triple systems have perfect matchings (Q3389173) (← links)
• (Q3750711) (← links)
• New estimates for Ritz vectors (Q4340852) (← links)
• New bounds on the strength of some restrictions of Hindman’s Theorem (Q5131646) (← links)
• Transversals in generalized Latin squares (Q5225021) (← links)
• Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
• Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
• A new approach to the Dyson rank conjectures (Q6098228) (← links)
• Colorful Matchings (Q6098465) (← links)
• Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets (Q6133146) (← links)
• Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor (Q6135844) (← links)
• New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)
• A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems (Q6603918) (← links)