Louis DeBiasio

activity

20112026

most citedUpper density of monochromatic infinite paths

4 citations · 15 across the 25 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017

Spanning trees with few branch vertices

Louis DeBiasio, Allan Lo

A branch vertex in a tree is a vertex of degree at least three. We prove that, for all $s \geq 1$ , every connected graph on $n$ vertices with minimum degree at least $(\frac{1}{s+3}…

math.CO2017

Large monochromatic components and long monochromatic cycles in random hypergraphs

Patrick Bennett, Louis DeBiasio, Andrzej Dudek +1

We extend results of Gyárfás and Füredi on the largest monochromatic component in $r$ -colored complete $k$ -uniform hypergraphs to the setting of random hypergraphs. We also study l…

math.CO2017

Hamiltonian cycles in $k$ -partite graphs

Louis DeBiasio, Robert A. Krueger, Dan Pritikin +1

Chen, Faudree, Gould, Jacobson, and Lesniak determined the minimum degree threshold for which a balanced $k$ -partite graph has a Hamiltonian cycle. We give an asymptotically tight…

Spanning trees with few branch vertices

Large monochromatic components and long monochromatic cycles in random hypergraphs

Hamiltonian cycles in k-partite graphs

Hamiltonian cycles in $k$ -partite graphs