József Balogh

collaborators

2 papers

math.CO2025

Packing edge disjoint cliques in graphs

József Balogh, Michael C. Wigal

Let $r \geq 3$ be fixed and $G$ be an $n$ -vertex graph. A long-standing conjecture of Győri states that if $e (G) = t_{r - 1} (n) + k$ , where $t_{r - 1} (n)$ denotes the number of edges of…

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 bound…