15 citations · 149 across the 60 of their papers we have counts for
6 papers · 1 filter
Almost sharp bounds on the number of discrete chains in the plane
Nora Frankl, Andrey Kupavskii
The following generalisation of the Erdős unit distance problem was recently suggested by Palsson, Senger and Sheffer. Given positive real numbers , a -tu…
The right acute angles problem?
Andrey Kupavskii, Dmitriy Zakharov
The Danzer--Grünbaum acute angles problem asks for the largest size of a set of points in that determines only acute angles. Recently, the problem was essentially s…
Nearly -distance sets
Nóra Frankl, Andrey Kupavskii
We say that a set of points is an -nearly -distance set if there exist such that the distance between any two d…
Sharp results concerning disjoint cross-intersecting families
Peter Frankl, Andrey Kupavskii
For an -element set let be the collection of all its -subsets. Two families of sets and are called cross-intersecting if $A\cap B…
Beyond the Erdős Matching Conjecture
Peter Frankl, Andrey Kupavskii
A family is of for any we have . This notion generalizes the property of a…
Simple juntas for shifted families
Peter Frankl, Andrey Kupavskii
We say that a family of -element sets is a {\it -junta} if there is a set of size such that, for any , its presence in depends on its int…