Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets

DOI10.37236/11714zbMath1519.05198arXiv2212.03100WikidataQ123199806 ScholiaQ123199806MaRDI QIDQ6133146

Alp Müyesser, Michael Anastos, David Fabian, Tibor Szabó

Publication date: 18 August 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Ryser-Brualdi-Stein conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• An approximate version of a conjecture of Aharoni and Berger
• Fair splittings by independent sets in sparse graphs
• Fair Representation by Independent Sets
• Differences of Bijections
• New bounds for Ryser’s conjecture and related problems
• A Combinatorial Problem on Abelian Groups

This page was built for publication: Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets