22 citations · 53 across the 17 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014★ 1 cited
The number of maximal sum-free subsets of integers
József Balogh, Hong Liu, Maryam Sharifzadeh +1
Cameron and Erdős raised the question of how many maximal sum-free sets there are in , giving a lower bound of . In this paper we prove…
math.CO2014★ 5 cited
Intersecting families of discrete structures are typically trivial
József Balogh, Shagnik Das, Michelle Delcourt +2
The study of intersecting structures is central to extremal combinatorics. A family of permutations is \emph{-intersecting} if any two permutations in…
math.CO2014★ 4 cited
The typical structure of graphs with no large cliques
József Balogh, Neal Bushaw, Maurício Collares Neto +3
In 1987, Kolaitis, Prömel and Rothschild proved that, for every fixed , almost every -vertex -free graph is -partite. In this paper we extend this…