52 citations · 81 across the 8 of their papers we have counts for
5 papers · 1 filter
How many matchings cover the nodes of a graph?
Dehia Ait Ferhat, Zoltán Király, András Sebő +1
Given an undirected graph, are there matchings whose union covers all of its nodes, that is, a matching--cover? A first, easy polynomial solution from matroid union is possi…
Spanning tree with lower bound on the degrees
Zoltán Király
We concentrate on some recent results of Egawa and Ozeki [J. Graph Theory, 2015 and Combinatorica, 2014], and He et al. [J. Graph Theory, 2002]. We give shorter proofs and polynomi…
On Ryser's conjecture for t-intersecting and degree-bounded hypergraphs
Zoltan Kiraly, Lilla Tothmeresz
A famous conjecture (usually called Ryser's conjecture) that appeared in the Ph.D thesis of his student, J.~R.~Henderson [15], states that for an -uniform -partite hypergraph…
Covering complete partite hypergraphs by monochromatic components
András Gyárfás, Zoltán Király
A well-known special case of a conjecture attributed to Ryser states that k-partite intersecting hypergraphs have transversals of at most k-1 vertices. An equivalent form was formu…
On the swap-distances of different realizations of a graphical degree sequence
Péter L. Erdős, Zoltán Király, István Miklós
One of the first graph theoretical problems which got serious attention (already in the fifties of the last century) was to decide whether a given integer sequence is equal to the…