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

14 papers

math.CO2023

Triangle Percolation on the Grid

Igor Araujo, Bryce Frederickson, Robert A. Krueger +5

We consider a geometric percolation process partially motivated by recent work of Hejda and Kala. Specifically, we start with an initial set $X \subseteq Z^{2}$ , and then it…

math.CO2023

Realizable Standard Young Tableaux

Igor Araujo, Alexander E. Black, Amanda Burcroff +3

Given two vectors $u$ and $v$ , their outer sum is given by the matrix $A$ with entries $A_{ij} = u_{i} + v_{j}$ . If the entries of $u$ and $v$ are increasing and sufficiently gener…

math.CO2022

On oriented cycles in randomly perturbed digraphs

Igor Araujo, József Balogh, Robert A. Krueger +2

In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. For digraphs, they showed that for every $α > 0$ , there exists a constant $C$ such…

math.CO2022★ 1 cited

A sharp threshold for a random version of Sperner's Theorem

József Balogh, Robert A. Krueger

The Boolean lattice $P (n)$ consists of all subsets of $[n] = {1, \dots, n}$ partially ordered under the containment relation. Sperner's Theorem states that the largest a…

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…