4 citations · 15 across the 25 of their papers we have counts for
45 papers
Inheritance of expansion and oriented Hamilton cycles in robust expanders: a regularity-free proof
Louis DeBiasio
Häggkvist and Thomason proved that every -vertex oriented graph with minimum semidegree at least contains every orientation of a Hamilton cycle. Using Sze…
Bounded diameter covering of 2-colored complete bipartite graphs
Louis DeBiasio, András Gyárfás, Gábor N. Sárközy
Related to a bounded-diameter bipartite analogue of the Henderson--Ryser conjecture, DeBiasio, Kamel, McCourt, and Sheats proved that the vertices of every -colored complete bip…
The Hajnal-Szemerédi theorem in digraphs revisited
Louis DeBiasio, Yufei Chang, Hal Kierstead +3
The Hajnal--Szemerédi theorem states that every graph with admits an equitable -coloring. Using a reduction implicit in Aboulker, Oijid, Petit, Rocton, and Simon (…
On the Ramsey numbers of wheels, cycles, and stars
Louis DeBiasio, Tucker Wimbish
The wheel is the graph on vertices consisting of a vertex joined to a cycle of length , and we say that is an even wheel if is even. Mao, Wang, Magnant,…
On the Ramsey numbers of fans and stars
Louis DeBiasio, Tucker Wimbish
Let be the graph on vertices consisting of triangles meeting at a single vertex. After a number of improvements over the years, it is currently known that the Rams…
Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
Louis DeBiasio, Andrew Treglown
In 1960, Ghouila-Houri proved that every strongly connected directed graph on vertices with minimum degree at least contains a directed Hamilton cycle. We asymptoticall…