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 2021Show all

2 papers · 1 filter

math.CO2021

Sharp threshold for the Erdős-Ko-Rado theorem

József Balogh, Robert A. Krueger, Haoran Luo

For positive integers $n$ and $k$ with $n \geq 2 k + 1$ , the Kneser graph $K (n, k)$ is the graph with vertex set consisting of all $k$ -sets of ${1, \dots, n}$ , where two $k$ -sets are ad…

math.CO2021★ 2 cited

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

József Balogh, Sean English, Emily Heath +1

Given positive integers $p$ and $q$ , a $(p, q)$ -coloring of the complete graph $K_{n}$ is an edge-coloring in which every $p$ -clique receives at least $q$ colors. Erdős and Shelah pos…