Author
Keevash, P
Yepremyan, L
Journal title
SIAM Journal on Discrete Mathematics
DOI
10.1137/17M1151742
Issue
3
Volume
32
Last updated
2024-03-24T06:34:19.033+00:00
Page
1577-1584
Abstract
Aharoni and Berger conjectured that in any bipartite multigraph that is properly edge-colored by $n$ colors with at least $n + 1$ edges of each color there must be a matching that uses each color exactly once. In this paper we consider the same question without the bipartiteness assumption. We show that in any multigraph with edge multiplicities $o(n)$ that is properly edge-colored by $n$ colors with at least $n + o(n)$ edges of each color there must be a matching of size $n-O(1)$ that uses each color at most once. Read More: https://epubs.siam.org/doi/abs/10.1137/17M1151742
Symplectic ID
1079470
Favourite
Off
Publication type
Journal Article
Publication date
10 Jul 2018
Please contact us with feedback and comments about this page. Created on 24 Dec 2019 - 13:18.