The following pages link to Louis DeBiasio (Q345112):
Displayed 36 items.
- Monochromatic cycle partitions of graphs with large minimum degree (Q345114) (← links)
- Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs (Q394360) (← links)
- Partitioning random graphs into monochromatic components (Q510329) (← links)
- (Q907222) (redirect page) (← links)
- Semi-degree threshold for anti-directed Hamiltonian cycles (Q907223) (← links)
- Large monochromatic components and long monochromatic cycles in random hypergraphs (Q1633610) (← links)
- Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs (Q1783629) (← links)
- On Hamiltonian cycles in balanced \(k\)-partite graphs (Q1981710) (← links)
- New lower bounds on the size-Ramsey number of a path (Q2073313) (← links)
- Powers of Hamiltonian cycles in multipartite graphs (Q2075502) (← links)
- Generalizations and strengthenings of Ryser's conjecture (Q2121724) (← links)
- Long monochromatic paths and cycles in 2-colored bipartite graphs (Q2185910) (← links)
- Ramsey numbers of path-matchings, covering designs, and 1-cores (Q2221922) (← links)
- Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs (Q2335906) (← links)
- Density of monochromatic infinite subgraphs (Q2338615) (← links)
- On the co-degree threshold for the Fano plane (Q2441623) (← links)
- Tiling 3-Uniform Hypergraphs With K43−2e (Q2874094) (← links)
- Arbitrary Orientations of Hamilton Cycles in Digraphs (Q2944460) (← links)
- TILING DIRECTED GRAPHS WITH TOURNAMENTS (Q3119461) (← links)
- A Note on Bipartite Graph Tiling (Q3225134) (← links)
- Hamiltonian cycles in k‐partite graphs (Q5110679) (← links)
- Large monochromatic components in multicolored bipartite graphs (Q5110681) (← links)
- Upper density of monochromatic infinite paths (Q5126750) (← links)
- Ore-degree threshold for the square of a Hamiltonian cycle (Q5173167) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs (Q5364255) (← links)
- Pósa's conjecture for graphs of order at least 2 × 10<sup>8</sup> (Q5388972) (← links)
- 2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees (Q5392905) (← links)
- Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree (Q5854457) (← links)
- Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs (Q6057898) (← links)
- Large monochromatic components in hypergraphs with large minimum codegree (Q6144911) (← links)
- Large monochromatic components in 3‐edge‐colored Steiner triple systems (Q6187431) (← links)
- Tiling in bipartite graphs with asymmetric minimum degrees (Q6245283) (← links)
- A note about monochromatic components in graphs of large minimum degree (Q6342998) (← links)
- Density of monochromatic infinite subgraphs II (Q6346017) (← links)
- Large monochromatic components in expansive hypergraphs (Q6426359) (← links)