9 citations · 20 across the 5 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014
Graphs without proper subgraphs of minimum degree 3 and short cycles
Lothar Narins, Alexey Pokrovskiy, Tibor Szabó
We study graphs on vertices which have edges and no proper induced subgraphs of minimum degree . Erdős, Faudree, Gyárfás, and Schelp conjectured that such graphs alwa…
math.CO2014★ 9 cited
Extremal Hypergraphs for Ryser's Conjecture: Home-Base Hypergraphs
Penny Haxell, Lothar Narins, Tibor Szabó
Ryser's Conjecture states that any -partite -uniform hypergraph has a vertex cover of size at most times the size of the largest matching. For , the conjecture…
math.CO2014★ 5 cited
Extremal Hypergraphs for Ryser's Conjecture: Connectedness of Line Graphs of Bipartite Graphs
Penny Haxell, Lothar Narins, Tibor Szabó
In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the independence complex…