4 citations · 15 across the 25 of their papers we have counts for
5 papers · 1 filter
New lower bounds on the size-Ramsey number of a path
Deepak Bal, Louis DeBiasio
We prove that for all graphs with at most edges there exists a 2-coloring of the edges such that every monochromatic path has order less than . This was previousl…
Ramsey numbers of path-matchings, covering designs and 1-cores
Louis DeBiasio, András Gyárfás, Gábor N. Sárközy
A path-matching of order is a vertex disjoint union of nontrivial paths spanning vertices. Burr and Roberts, and Faudree and Schelp determined the 2-color Ramsey number of…
Large monochromatic components in 3-edge-colored Steiner triple systems
Louis DeBiasio, Michael Tait
It is known that in any -coloring of the edges of a complete -uniform hypergraph, there exists a spanning monochromatic component. Given a Steiner triple system on vertic…
On Hamiltonian cycles in balanced -partite graphs
Louis DeBiasio, Nicholas Spanier
For all integers with , if is a balanced -partite graph on vertices with minimum degree at least \[ \left\lceil\frac{n}{2}\right\rceil+\left\lfloor\fr…
Transitive tournament tilings in oriented graphs with large minimum total degree
Louis DeBiasio, Allan Lo, Theodore Molla +1
Let be the transitive tournament on vertices. We show that every oriented graph on vertices with minimum total degree can be partitioned into…