Louis DeBiasio

Office: BAC 229
Phone: 513-529-1491
Email: debiasld@miamioh.edu
URL: http://www.users.miamioh.edu/debiasld/

Associate Professor of Mathematics

123 Bachelor Hall
301 S. Patterson Ave.
Oxford, OH 45056




2013-2018 Simons Collaboration Grant

2012 Project NExT fellow

MIGHTY LIV at Miami University -- April 6, 2013



23) Upper density of monochromatic infinite paths, to appear in Advances in Combinatorics (with Jan Corsten, Ander Lamaison, and Richard Lang)

22) Large monochromatic components in multicolored bipartite graphs, submitted (with Robert A. Krueger and Gábor N. Sárközy)

21) Long monochromatic paths and cycles in 2-colored bipartite graphs, submitted (with Robert A. Krueger)

20) Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs, Discrete Mathematics 341, no. 11 (2018), 3134--3140.(with Carl Bürger, Hannah Guggiari, and Max Pitz)

19) Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs, to appear in Journal of Combinatorics (with András Gyárfás, Robert A. Krueger, Miklós Ruszinkó, and Gábor N. Sárközy).

18) Spanning trees with few branch vertices, submitted (with Allan Lo).

17) Large monochromatic components and long monochromatic cycles in random hypergraphs, European Journal of Combinatorics 76, (2019), 123--137. (with Patrick Bennett, Andrzej Dudek, and Sean English)

16) Hamiltonian cycles in k-partite graphs, submitted (with Robert A. Krueger, Dan Pritikin, and Eli Thompson)

15) Density of monochromatic infinite subgraphs, to appear in Combinatorica (with Paul McKenney)

14) Tiling directed graphs with tournaments, Forum of Mathematics, Sigma (2018), Vol. 6, e2, 53 pages (with Andrzej Czygrinow, Theo Molla, and Andrew Treglown)

13) Partitioning random graphs into monochromatic components, Electronic Journal of Combinatorics 24, no. 1 (2017), P1.18. (with Deepak Bal)

12) Monochromatic cycle partitions of graphs with large minimum degree, Journal of Combinatorial Theory, Series B 122 (2017), 634--667. (with Luke Nelsen)

11) Arbitrary orientations of Hamilton cycles in digraphs, SIAM Journal on Discrete Mathematics 29, no. 3 (2015), 1553--1584. (with Daniela Kühn, Theo Molla, Deryk Osthus, and Amelia Taylor)

10) Ore-degree threshold for the square of a Hamiltonian cycle, Discrete Mathematics and Theoretical Computer Science 17, no. 1 (2015), 13--32. (with Safi Faizullah and Imdadullah Khan)

9) Improved degree conditions for 2-factors with k cycles in Hamiltonian graphs, Discrete Mathematics 320 (2014), 51--54. (with Mike Ferrara and Tim Morris)

8) An extension of the Hajnal-Szemerédi theorem to directed graphs, Combinatorics, Probability, and Computing 24, no. 5 (2015), 754--773. (with Andrzej Czygrinow, H.A. Kierstead, and Theo Molla)

7) Semi-degree threshold for anti-directed Hamiltonian cycles, Electronic Journal of Combinatorics 22, no. 4 (2015), P4.34. (with Theo Molla)

6) On the co-degree threshold for the Fano plane, European Journal of Combinatorics 36, (2014), 151--158. (with Tao Jiang)

5) Tiling 3-uniform hypergraphs with \(K_4^3-2e\), Journal of Graph Theory 75, no. 2 (2014), 124--136. (with Andrzej Czygrinow and Brendan Nagle)

4) Tiling in bipartite graphs with asymmetric minimum degrees, (with Andrzej Czygrinow)

3) A note on bipartite graph tiling, SIAM Journal on Discrete Mathematics 25, no. 4 (2011), 1477--1489. (with Andrzej Czygrinow)

2) Posa's conjecture for graphs of order at least \(2\times 10^8\), Random Structures and Algorithms 39, no. 4 (2011), 507--525. (with Phong Chau and H.A. Kierstead)

1) 2-Factors of bipartite graphs with asymmetric minimum degrees, SIAM Journal on Discrete Mathematics 24, no. 2 (2010), 486--504. (with Andrzej Czygrinow and H.A. Kierstead)

0) Optimal degree conditions for spanning subgraphs, Ph.D. Thesis, Arizona State University

Math Genealogy link

MathSciNet link

Image © Kelsey Vance