Louis DeBiasio

Orcid: 0000-0002-7569-7952

According to our database1, Louis DeBiasio authored at least 31 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Large monochromatic components in hypergraphs with large minimum codegree.
J. Graph Theory, March, 2024

A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs.
Eur. J. Comb., 2024

Large monochromatic components in expansive hypergraphs.
Comb. Probab. Comput., 2024

2023
A note about monochromatic components in graphs of large minimum degree.
Discuss. Math. Graph Theory, 2023

2022
Covering 2-colored complete digraphs by monochromatic d $d$ -dominating digraphs.
J. Graph Theory, 2022

Powers of Hamiltonian cycles in multipartite graphs.
Discret. Math., 2022

New Lower Bounds on the Size-Ramsey Number of a Path.
Electron. J. Comb., 2022

2021
Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree.
SIAM J. Discret. Math., 2021

Ramsey numbers of path-matchings, covering designs, and 1-cores.
J. Comb. Theory B, 2021

On Hamiltonian cycles in balanced <i>k</i>-partite graphs.
Discret. Math., 2021

Generalizations and Strengthenings of Ryser's Conjecture.
Electron. J. Comb., 2021

2020
Large monochromatic components in multicolored bipartite graphs.
J. Graph Theory, 2020

Hamiltonian cycles in k -partite graphs.
J. Graph Theory, 2020

Long monochromatic paths and cycles in 2-colored bipartite graphs.
Discret. Math., 2020

2019
Spanning Trees with Few Branch Vertices.
SIAM J. Discret. Math., 2019

Large monochromatic components and long monochromatic cycles in random hypergraphs.
Eur. J. Comb., 2019

Density of Monochromatic Infinite Subgraphs.
Comb., 2019

2018
Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs.
Discret. Math., 2018

2017
Monochromatic cycle partitions of graphs with large minimum degree.
J. Comb. Theory B, 2017

Partitioning Random Graphs into Monochromatic Components.
Electron. J. Comb., 2017

2015
Arbitrary Orientations of Hamilton Cycles in Digraphs.
SIAM J. Discret. Math., 2015

Ore-degree threshold for the square of a Hamiltonian cycle.
Discret. Math. Theor. Comput. Sci., 2015

An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs.
Comb. Probab. Comput., 2015

2014
Tiling 3-Uniform Hypergraphs With K43-2e.
J. Graph Theory, 2014

On the co-degree threshold for the Fano plane.
Eur. J. Comb., 2014

Improved degree conditions for 2-factors with k cycles in hamiltonian graphs.
Discret. Math., 2014

2013
Semi-degree threshold for anti-directed Hamiltonian cycles.
Electron. Notes Discret. Math., 2013

2011
Optimal Degree Conditions for Spanning Subgraphs.
PhD thesis, 2011

A Note on Bipartite Graph Tiling.
SIAM J. Discret. Math., 2011

Pósa's conjecture for graphs of order at least 2 × 10<sup>8</sup>.
Random Struct. Algorithms, 2011

2010
2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees.
SIAM J. Discret. Math., 2010


  Loading...