105 citations · 718 across the 103 of their papers we have counts for
7 papers · 2 filters
On the tree packing conjecture
József Balogh, Cory Palmer
The Gyárfás tree packing conjecture states that any set of trees such that has vertices pack into . We show that …
Towards a weighted version of the Hajnal-Szemerédi Theorem
József Balogh, Graeme Kemkes, Choongbum Lee +1
For a positive integer r>=2, a K_r-factor of a graph is a collection vertex-disjoint copies of K_r which covers all the vertices of the given graph. The celebrated theorem of Hajna…
Independent sets in hypergraphs
József Balogh, Robert Morris, Wojciech Samotij
Many important theorems in combinatorics, such as Szemerédi's theorem on arithmetic progressions and the Erdős-Stone Theorem in extremal graph theory, can be phrased as statements…
On the decay of crossing numbers of sparse graphs
Jozsef Balogh, Jesus Leanos, Gelasio Salazar
Richter and Thomassen proved that every graph has an edge such that the crossing number $\ucr(G-e)$ of is at least $(2/5)\ucr(G) - O(1)$. Fox and Cs. Tóth proved that den…
A refinement of the Cameron-Erdős Conjecture
Noga Alon, József Balogh, Robert Morris +1
In this paper we study sum-free subsets of the set , that is, subsets of the first positive integers which contain no solution to the equation . Cameron…
Counting sum-free sets in Abelian groups
Noga Alon, József Balogh, Robert Morris +1
In this paper we study sum-free sets of order in finite Abelian groups. We prove a general theorem on 3-uniform hypergraphs, which allows us to deduce structural results in the…
Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
József Balogh, Ping Hu, Bernard Lidický +1
In this paper we modify slightly Razborov's flag algebra machinery to be suitable for the hypercube. We use this modified method to show that the maximum number of edges of a 4-cyc…