Robert A. Krueger

collaborators

2 papers

math.CO2026

Universality for rainbow oriented cycles in perturbed digraphs

Robert A. Krueger, David Staudinger

A randomly perturbed digraph is an $n$ -vertex directed graph with all out- and in-degrees linear in $n$ , to which a linear number (depending on the degree) of random edges have bee…

math.CO2024

Clique covers and decompositions of cliques of graphs

JÃ³zsef Balogh, Jialin He, Robert A. Krueger +2

In 1966, ErdÅs, Goodman, and PÃ³sa showed that if $G$ is an $n$ -vertex graph, then at most $⌊ n^{2} /4 ⌋$ cliques of $G$ are needed to cover the edges of $G$ , and the bou…