58 citations · 220 across the 56 of their papers we have counts for
4 papers · 1 filter
Densities in large permutations and parameter testing
Roman Glebov, Carlos Hoppen, Tereza Klimosova +3
A classical theorem of Erdos, Lovasz and Spencer asserts that the densities of connected subgraphs in large graphs are independent. We prove an analogue of this theorem for permuta…
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…
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…
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…