On a two-sided Turán problem.
On cross-intersecting uniform sub-families of hereditary families.
On hypergraphs of girth five.
On hypergraphs with every four points spanning at most two triples.
On non-intersecting arithmetic progressions
We improve known bounds for the maximum number of pairwise disjoint arithmetic progressions using distinct moduli less than x. We close the gap between upper and lower bounds even further under the assumption of a conjecture from combinatorics about Δ-systems (also known as sunflowers).
On randomly generated intersecting hypergraphs.
On randomly generated non-trivially intersecting hypergraphs.
On sets of integers containing k elements in arithmetic progression
On the most weight vectors in a dimension binary code.
Packing of nonuniform hypergraphs - product and sum of sizes conditions
Hypergraphs of order n are mutually packable if one can find their edge disjoint copies in the complete hypergraph of order n. We prove that two hypergraphs are mutually packable if the product of their sizes satisfies some upper bound. Moreover we show that an arbitrary set of the hypergraphs is mutually packable if the sum of their sizes is sufficiently small.
Pattern avoidance in matrices.
Proof of an intersection theorem via graph homomorphisms.
Ramsey problems in additive number theory
Restricted sumsets in finite vector spaces: the case .
Set families with a forbidden subposet.
Set systems with restricted -wise intersections modulo prime powers.
Set-systems with restricted multiple intersections.
Small forbidden configurations. II.
Small forbidden configurations. III.
Some results in additive number theory I: The critical pair theory