Extremal hypergraphs for Ryser's Conjecture

Abstract Ryser's Conjecture states that any r -partite r -uniform hypergraph has a vertex cover of size at most r − 1 times the size of the largest matching. For r = 2 , the conjecture is simply Konig's Theorem and every bipartite graph is a witness for its tightness. The conjecture has also been proven for r = 3 by Aharoni using topological methods, but the proof does not give information on the extremal 3-uniform hypergraphs. Our goal in this paper is to characterize those hypergraphs which are tight for Aharoni's Theorem. Our proof of this characterization is also based on topological machinery, particularly utilizing results on the (topological) connectedness of the independence complex of the line graph of the link graphs of 3-uniform Ryser-extremal hypergraphs. We use this information to nail down the elements of a structure we call home-base hypergraph . While there is a single minimal home-base hypergraph with matching number k for every positive integer k ∈ N , home-base hypergraphs with matching number k are far from being unique. There are infinitely many of them and each of them is composed of k copies of two different kinds of basic structures, whose hyperedges can intersect in various restricted, but intricate ways. Our characterization also proves an old and wide open strengthening of Ryser's Conjecture, due to Lovasz, for the 3-uniform extremal case, that is, for hypergraphs with τ = 2 ν .

[1]  Zoltán Füredi,et al.  Maximum degree and fractional matchings in uniform hypergraphs , 1981, Comb..

[2]  Alexey Pokrovskiy,et al.  Intersecting extremal constructions in Ryser's Conjecture for r-partite hypergraphs , 2014, 1409.4938.

[3]  J. Hudson.  Piecewise linear topology , 1966 .

[4]  P. Haxell.  Independent transversals and hypergraph matchings - an elementary approach , 2016 .

[5]  E. Sperner.  Neuer beweis für die invarianz der dimensionszahl und des gebietes , 1928 .

[6]  Roy Meshulam,et al.  Domination numbers and homology , 2003, J. Comb. Theory A.

[7]  Brendan D. McKay,et al.  On Ryser's conjecture for linear intersecting multipartite hypergraphs , 2015, Eur. J. Comb..

[8]  J. W. Cannon,et al.  Shrinking cell-like decompositions of manifolds. Codimension three , 1979 .

[9]  J. Milnor.  Construction of Universal Bundles, II , 1956 .

[10]  Aharoni,et al.  Triangulated Spheres and Colored Cliques , 2002 .

[11]  Penny E. Haxell,et al.  On Ryser's conjecture , 2012, Electron. J. Comb..

[12]  Raphael Yuster,et al.  A Comment on Ryser’s Conjecture for Intersecting Hypergraphs , 2007, Graphs Comb..

[13]  Alexey Pokrovskiy,et al.  A family of extremal hypergraphs for Ryser's conjecture , 2019, J. Comb. Theory, Ser. A.

[14]  Ron Aharoni,et al.  The intersection of a matroid and a simplicial complex , 2006 .

[15]  E.R. Berlekamp.  On Subsets with Intersections of Even Cardinality , 1969, Canadian Mathematical Bulletin.

[16]  Ron Aharoni,et al.  Independent systems of representatives in weighted graphs , 2007, Comb..

[17]  Ron Aharoni,et al.  Hall's theorem for hypergraphs , 2000, J. Graph Theory.

[18]  Ron Aharoni.  Ryser's Conjecture for Tripartite 3-Graphs , 2001, Comb..

[19]  Michal Adamaszek,et al.  On a lower bound for the connectivity of the independence complex of a graph , 2011, Discret. Math..

[20]  Penny E. Haxell,et al.  A condition for matchability in hypergraphs , 1995, Graphs Comb..

[21]  B. Szegedy,et al.  On the logarithimic calculus and Sidorenko's conjecture , 2011, 1107.1153.

[22]  Penny Haxell,et al.  Extremal Hypergraphs for Ryser's Conjecture: Home-Base Hypergraphs , 2013 .

[23]  Gábor Tardos,et al.  Extremal Problems For Transversals In Graphs With Bounded Degree , 2006, Comb..

[24]  Eli Berger,et al.  A note on the edge cover number and independence number in hypergraphs , 2008, Discret. Math..

[25]  Alexander Sidorenko,et al.  A correlation inequality for bipartite graphs , 1993, Graphs Comb..

[26]  Ian M. Wanless,et al.  Multipartite Hypergraphs Achieving Equality in Ryser’s Conjecture , 2016, Graphs Comb..