4 citations · 4 across the 10 of their papers we have counts for
5 papers · 1 filter
Randomised algebraic constructions for the no--in-line problem
Benedek Kovács, Zoltán Lóránt Nagy, Dávid R. Szabó
The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an square lattice such that no of them are collinear. The problem was f…
Code-based -avoiders in finite affine spaces
Benedek Kovács
The author, together with Nagy, studied the following problem on unavoidable intersections of given size in binary affine spaces. Given an -element set $S\subseteq \mathbb{F}_2^…
The generalized trifference problem
Anurag Bishnoi, Bartłomiej Kielak, Benedek Kovács +4
We study the problem of finding the largest number of ternary vectors of length such that for any three distinct vectors there are at least coordinates where they…
Cardinalities of the total number of independent sets
Benedek Kovács, Zoltán Lóránt Nagy
We study the set of numbers the total number of independent sets can admit in -vertex graphs. In this paper, we prove that the cardinality of this set is very…
Settling the no--in-line problem when is not small
Benedek Kovács, Zoltán Lóránt Nagy, Dávid R. Szabó
What is the maximum number of points that can be selected from an square lattice such that no of them are in a line? This has been asked more than years ag…