9 citations · 20 across the 5 of their papers we have counts for
7 papers · 1 filter
A Stability Theorem for Matchings in Tripartite 3-Graphs
Penny Haxell, Lothar Narins
It follows from known results that every regular tripartite hypergraph of positive degree, with vertices in each class, has matching number at least . This bound is best p…
Strong Ramsey Games: Drawing on an infinite board
Dan Hefetz, Christopher Kusch, Lothar Narins +3
We consider the strong Ramsey-type game , played on the edge set of the infinite complete -uniform hypergraph . Two p…
On the connectivity Waiter-Client game
Sylwia Antoniuk, Codruut Grosu, Lothar Narins
In this short note we consider a variation of the connectivity Waiter-Client game played on an -vertex graph which consists of disjoint spanning…
A Density Turán Theorem
Lothar Narins, Tuan Tran
Let be a graph which contains an edge whose deletion reduces its chromatic number. For such a graph a classical result of Simonovits from 1966 shows that every graph on $n…
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…
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…
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…