Robert A. Krueger

activity

20172023

most citedLower bounds on the Erdős-Gyárfás problem via color energy graphs

2 citations · 3 across the 8 of their papers we have counts for

collaborators

Showing 2018Show all

4 papers · 1 filter

math.CO2018

Partitioning the power set of $[n]$ into $C_{k}$ -free parts

Eben Blaisdell, András Gyárfás, Robert A. Krueger +1

We show that for $n \geq 3, n \neq = 5$ , in any partition of $P (n)$ , the set of all subsets of $[n] = {1, 2, \dots, n}$ , into $2^{n - 2} - 1$ parts, some part must contain a triangl…

math.CO2018

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 $K_{n, n}$ there exists a monochromatic path on at least $2 ⌈ n /2 ⌉$ ver…

math.CO2018

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 $r$ -coloring of the edges of the complete bipartite graph $K_{m, n}$ there is a monochromatic connected component with at least $\frac{m + n}{r}$ vertice…

math.CO2018

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 $r$ -coloring of the edges of the complete bipartite graph $K_{n, n}$ there is a monochromatic connected component with at least $\frac{2 n}{r}$ vertices…

Partitioning the power set of [n] into Ck​-free parts

Long monochromatic paths and cycles in 2-colored bipartite graphs

Large monochromatic components in multicolored bipartite graphs

Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs

Partitioning the power set of $[n]$ into $C_{k}$ -free parts