4 citations · 15 across the 25 of their papers we have counts for
5 papers · 1 filter
Upper density of monochromatic infinite paths
Jan Corsten, Louis DeBiasio, Ander Lamaison +1
We prove that in every -colouring of the edges of there exists a monochromatic infinite path such that has upper density at least ${(12+\sqrt{8})}/{17}…
Long monochromatic paths and cycles in 2-colored bipartite graphs
Louis DeBiasio, Robert A. Krueger
Gyárfás and Lehel and independently Faudree and Schelp proved that in any 2-coloring of the edges of there exists a monochromatic path on at least ver…
Large monochromatic components in multicolored bipartite graphs
Louis DeBiasio, Robert A. Krueger, Gábor N. Sárközy
It is well-known that in every -coloring of the edges of the complete bipartite graph there is a monochromatic connected component with at least vertice…
Partitioning Edge-Coloured Complete Symmetric Digraphs into Monochromatic Complete Subgraphs
Carl Bürger, Louis DeBiasio, Hannah Guggiari +1
Let be the complete symmetric digraph on the positive integers. Answering a question of DeBiasio and McKenney, we construct a -colouring of the edges of $K_{\ma…
Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs
Louis DeBiasio, András Gyárfás, Robert A. Krueger +2
It is well-known that in every -coloring of the edges of the complete bipartite graph there is a monochromatic connected component with at least vertices…