#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2010

2017

- This year (2)
- Last five years (9)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Louis DeBiasio, Luke L. Nelsen
- J. Comb. Theory, Ser. B
- 2017

- Phong Châu, Louis DeBiasio, Hal A. Kierstead
- Random Struct. Algorithms
- 2011

- Andrzej Czygrinow, Louis DeBiasio, Brendan Nagle
- Journal of Graph Theory
- 2014

- Andrzej Czygrinow, Louis DeBiasio
- SIAM J. Discrete Math.
- 2011

- Louis DeBiasio, Safi Faizullah, Imdadullah Khan
- Discrete Mathematics & Theoretical Computer…
- 2015

- Louis DeBiasio, Tao Jiang
- Eur. J. Comb.
- 2014

- Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead, Theodore Molla
- Combinatorics, Probability & Computing
- 2015

- Louis DeBiasio, Daniela Kühn, Theodore Molla, Deryk Osthus, Amelia Taylor
- SIAM J. Discrete Math.
- 2015

Let n be sufficiently large and suppose that G is a digraph on n vertices where every vertex has in-and outdegree at least n/2. We show that G contains every orientation of a Hamilton cycle except, possibly, the antidirected one. The antidirected case was settled by DeBiasio and Molla, where the threshold is n/2 + 1. Our result is best possible and improves… (More)

- Louis DeBiasio, Michael Ferrara, Timothy Morris
- Discrete Mathematics
- 2014

In this paper, we consider conditions that ensure a hamiltonian graph has a 2-factor with exactly k cycles. Brandt et al. proved that if G is a graph on n ≥ 4k vertices with minimum degree at least n 2 , then G contains a 2-factor with exactly k cycles; moreover this is best possible. Faudree et al. asked if there is some c < 1 2 such that δ(G) ≥ cn would… (More)

- Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead
- SIAM J. Discrete Math.
- 2010

Let G and H be balanced U, V-bigraphs on 2n vertices with ∆(H) ≤ 2. Let k be the number of components of H, δ U := min{deg G (u) : u ∈ U } and δ V := min{deg G (v) : v ∈ V }. We prove that if n is sufficiently large and δ U + δ V ≥ n + k then G contains H. This answers a question of Amar in the case that n is large. We also show that G contains H even when… (More)