105 citations · 718 across the 103 of their papers we have counts for
7 papers · 2 filters
On perfect packings in dense graphs
József Balogh, Alexandr V. Kostochka, Andrew Treglown
We say that a graph G has a perfect H-packing if there exists a set of vertex-disjoint copies of H which cover all the vertices in G. We consider various problems concerning perfec…
On the Ramsey-Turán numbers of graphs and hypergraphs
József Balogh, John Lenz
Let t be an integer, f(n) a function, and H a graph. Define the t-Ramsey-Turán number of H, RT_t(n, H, f(n)), to be the maximum number of edges in an n-vertex, H-free graph G where…
Some Exact Ramsey-Turán Numbers
József Balogh, John Lenz
Let r be an integer, f(n) a function, and H a graph. Introduced by Erdős, Hajnal, Sós, and Szemerédi, the r-Ramsey-Turán number of H, RT_r(n, H, f(n)), is defined to be the maximum…
Linear algebra and bootstrap percolation
József Balogh, Béla Bollobás, Robert Morris +1
In $\HH$-bootstrap percolation, a set $A \subset V(\HH)$ of initially 'infected' vertices spreads by infecting vertices which are the only uninfected vertex in an edge of the hyper…
Graph bootstrap percolation
József Balogh, Béla Bollobás, Robert Morris
Graph bootstrap percolation is a deterministic cellular automaton which was introduced by Bollobás in 1968, and is defined as follows. Given a graph , and a set $G \subset E(K_n…
Random sum-free subsets of Abelian groups
József Balogh, Robert Morris, Wojciech Samotij
We characterize the structure of maximum-size sum-free subsets of a random subset of an Abelian group . In particular, we determine the threshold …
On the Chromatic Thresholds of Hypergraphs
József Balogh, Jane Butterfield, Ping Hu +2
Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-negative reals c such that the subfamily of F comprising hypergraphs H with minim…