default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLouis DeBiasio
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Deepak Bal, Louis DeBiasio:
Large monochromatic components in expansive hypergraphs. Comb. Probab. Comput. 33(4): 467-483 (2024)- [j30]Deepak Bal, Louis DeBiasio, Allan Lo:
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs. Eur. J. Comb. 120: 103969 (2024) - [j29]Deepak Bal
, Louis DeBiasio:
Large monochromatic components in hypergraphs with large minimum codegree. J. Graph Theory 105(3): 367-372 (2024) - 2023
- [j28]Louis DeBiasio, Robert A. Krueger:
A note about monochromatic components in graphs of large minimum degree. Discuss. Math. Graph Theory 43(3): 607-618 (2023) - 2022
- [j27]Deepak Bal, Louis DeBiasio:
New Lower Bounds on the Size-Ramsey Number of a Path. Electron. J. Comb. 29(1) (2022) - [j26]Louis DeBiasio, Ryan R. Martin, Theodore Molla:
Powers of Hamiltonian cycles in multipartite graphs. Discret. Math. 345(4): 112747 (2022) - [j25]Louis DeBiasio, András Gyárfás:
Covering 2-colored complete digraphs by monochromatic d $d$ -dominating digraphs. J. Graph Theory 100(4): 721-726 (2022) - 2021
- [j24]Louis DeBiasio, Yigal Kamel, Grace McCourt, Hannah Sheats:
Generalizations and Strengthenings of Ryser's Conjecture. Electron. J. Comb. 28(4) (2021) - [j23]Louis DeBiasio, Nicholas Spanier:
On Hamiltonian cycles in balanced k-partite graphs. Discret. Math. 344(11): 112583 (2021) - [j22]Louis DeBiasio, András Gyárfás, Gábor N. Sárközy:
Ramsey numbers of path-matchings, covering designs, and 1-cores. J. Comb. Theory B 146: 124-140 (2021) - [j21]Louis DeBiasio, Allan Lo, Theodore Molla, Andrew Treglown:
Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree. SIAM J. Discret. Math. 35(1): 250-266 (2021) - 2020
- [j20]Louis DeBiasio, Robert A. Krueger:
Long monochromatic paths and cycles in 2-colored bipartite graphs. Discret. Math. 343(8): 111907 (2020) - [j19]Louis DeBiasio, Robert A. Krueger, Dan Pritikin, Eli Thompson:
Hamiltonian cycles in k -partite graphs. J. Graph Theory 94(1): 92-112 (2020) - [j18]Louis DeBiasio, Robert A. Krueger, Gábor N. Sárközy:
Large monochromatic components in multicolored bipartite graphs. J. Graph Theory 94(1): 117-130 (2020)
2010 – 2019
- 2019
- [j17]Louis DeBiasio, Paul McKenney:
Density of Monochromatic Infinite Subgraphs. Comb. 39(4): 847-878 (2019) - [j16]Patrick Bennett, Louis DeBiasio, Andrzej Dudek, Sean English:
Large monochromatic components and long monochromatic cycles in random hypergraphs. Eur. J. Comb. 76: 123-137 (2019) - [j15]Louis DeBiasio, Allan Lo:
Spanning Trees with Few Branch Vertices. SIAM J. Discret. Math. 33(3): 1503-1520 (2019) - 2018
- [j14]Carl Bürger, Louis DeBiasio, Hannah Guggiari, Max Pitz:
Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs. Discret. Math. 341(11): 3134-3140 (2018) - 2017
- [j13]Deepak Bal, Louis DeBiasio:
Partitioning Random Graphs into Monochromatic Components. Electron. J. Comb. 24(1): 1 (2017) - [j12]Louis DeBiasio, Luke L. Nelsen:
Monochromatic cycle partitions of graphs with large minimum degree. J. Comb. Theory B 122: 634-667 (2017) - [i1]Louis DeBiasio, Allan Lo:
Spanning trees with few branch vertices. CoRR abs/1709.04937 (2017) - 2015
- [j11]Louis DeBiasio, Theodore Molla:
Semi-Degree Threshold for Anti-Directed Hamiltonian Cycles. Electron. J. Comb. 22(4): 4 (2015) - [j10]Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead, Theodore Molla:
An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs. Comb. Probab. Comput. 24(5): 754-773 (2015) - [j9]Louis DeBiasio, Safi Faizullah, Imdadullah Khan:
Ore-degree threshold for the square of a Hamiltonian cycle. Discret. Math. Theor. Comput. Sci. 17(1): 13-32 (2015) - [j8]Louis DeBiasio, Daniela Kühn, Theodore Molla, Deryk Osthus, Amelia Taylor:
Arbitrary Orientations of Hamilton Cycles in Digraphs. SIAM J. Discret. Math. 29(3): 1553-1584 (2015) - 2014
- [j7]Louis DeBiasio, Michael Ferrara, Timothy Morris:
Improved degree conditions for 2-factors with k cycles in hamiltonian graphs. Discret. Math. 320: 51-54 (2014) - [j6]Louis DeBiasio, Tao Jiang:
On the co-degree threshold for the Fano plane. Eur. J. Comb. 36: 151-158 (2014) - [j5]Andrzej Czygrinow, Louis DeBiasio, Brendan Nagle:
Tiling 3-Uniform Hypergraphs With K43-2e. J. Graph Theory 75(2): 124-136 (2014) - 2013
- [j4]Louis DeBiasio, Theodore Molla:
Semi-degree threshold for anti-directed Hamiltonian cycles. Electron. Notes Discret. Math. 43: 195-200 (2013) - 2011
- [b1]Louis DeBiasio:
Optimal Degree Conditions for Spanning Subgraphs. Arizona State University, Tempe, USA, 2011 - [j3]Phong Châu, Louis DeBiasio, Hal A. Kierstead:
Pósa's conjecture for graphs of order at least 2 × 108. Random Struct. Algorithms 39(4): 507-525 (2011) - [j2]Andrzej Czygrinow, Louis DeBiasio:
A Note on Bipartite Graph Tiling. SIAM J. Discret. Math. 25(4): 1477-1489 (2011) - 2010
- [j1]Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead:
2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees. SIAM J. Discret. Math. 24(2): 486-504 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
