| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903565 | European Journal of Combinatorics | 2018 | 16 Pages |
Abstract
We prove several (modest) results in support of this conjecture, showing, in particular, that it holds for each of the three families consisting of two connected graphs with 3 edges each and observing that it holds for any family F containing a forest with at most 2 edges. We also study some related problems and disprove a conjecture by Aharoni et al. (2015) regarding the size of matchings in regular 3-partite 3-uniform hypergraphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ron Aharoni, Noga Alon, Michal Amir, Penny Haxell, Dan Hefetz, Zilin Jiang, Gal Kronenberg, Alon Naor,