11 citations · 29 across the 14 of their papers we have counts for
4 papers · 1 filter
On directed versions of the Corrádi-Hajnal Corollary
Andrzej Czygrinow, H. A. Kierstead, Theodore Molla
For , Corrádi and Hajnal proved that every graph on vertices with minimum degree has a -factor, i.e., a partitioning of the vertex set…
Tight co-degree condition for the existence of loose Hamilton cycles in 3-graphs
Andrzej Czygrinow, Theodore Molla
In 2006, Kühn and Osthus showed that if a 3-graph H on n vertices has minimum co-degree at least (1/4 +o(1))n and n is even then H has a loose Hamilton cycle. In this paper, we pro…
Semi-degree threshold for anti-directed Hamiltonian cycles
Louis DeBiasio, Theodore Molla
In 1960, Ghouila-Houri extended Dirac's theorem to directed graphs by proving that if D is a directed graph on n vertices with minimum out-degree and in-degree at least n/2 (i.e. m…
An extension of the Hajnal-Szemeredi theorem to directed graphs
Andrzej Czygrinow, Louis DeBiasio, H. A. Kierstead +1
Hajnal and Szemeredi proved that every graph G with |G|=ks and minimum degree at least k(s-1) contains k vertex disjoint s-cliques; moreover this degree bound is optimal. We extend…