Maryam Sharifzadeh

most citedIntersecting families of discrete structures are typically trivial

5 citations · 10 across the 3 of their papers we have counts for

collaborators

3 papers

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 ${1, \dots, n}$ , giving a lower bound of $2^{⌊ n /4 ⌋}$ . 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 $F \subset S_{n}$ is \emph{ $t$ -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 $r \in N$ , almost every $n$ -vertex $K_{r + 1}$ -free graph is $r$ -partite. In this paper we extend this…