9 citations · 25 across the 11 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.CO2022
Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets
Michael Anastos, David Fabian, Alp Müyesser +1
We study multigraphs whose edge-sets are the union of three perfect matchings, , , and . Given such a graph and any with $a_1+a_2+a_3…
math.CO2022★ 1 cited
New Ramsey Multiplicity Bounds and Search Heuristics
Olaf Parczyk, Sebastian Pokutta, Christoph Spiegel +1
We study two related problems concerning the number of homogeneous subsets of given size in graphs that go back to questions of Erdős. Most notably, we improve the upper bounds on…
cs.DS2022★ 1 cited
Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole
Penny Haxell, Tibor Szabó
In the max-min allocation problem a set of players are to be allocated disjoint subsets of a set of indivisible resources, such that the minimum utility among all players i…