4 citations · 15 across the 25 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014
Monochromatic cycle partitions of graphs with large minimum degree
Louis DeBiasio, Luke Nelsen
Lehel conjectured that in every -coloring of the edges of , there is a vertex disjoint red and blue cycle which span . Łuczak, Rödl, and Szemerédi proved Lehel's co…
math.CO2014
Arbitrary Orientations of Hamilton Cycles in Digraphs
Louis DeBiasio, Daniela Kühn, Theodore Molla +2
Let be sufficiently large and suppose that is a digraph on vertices where every vertex has in- and outdegree at least . We show that contains every orientation…
math.CO2014
Ore-degree threshold for the square of a Hamiltonian cycle
Louis DeBiasio, Safi Faizullah, Imdadullah Khan
A classic theorem of Dirac from 1952 states that every graph with minimum degree at least n/2 contains a Hamiltonian cycle. In 1963, Pósa conjectured that every graph with minimum…