Benedek Kovács

collaborators

5 papers

math.CO2025

Code-based $[3, 1]$ -avoiders in finite affine spaces $AG (n, 2)$

Benedek Kovács

The author, together with Nagy, studied the following problem on unavoidable intersections of given size in binary affine spaces. Given an $m$ -element set $S\subseteq \mathbb{F}_2^…

math.CO2025

The generalized trifference problem

Anurag Bishnoi, Bartłomiej Kielak, Benedek Kovács +4

We study the problem of finding the largest number $T (n, m)$ of ternary vectors of length $n$ such that for any three distinct vectors there are at least $m$ coordinates where they…

math.CO2025

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 $n$ -vertex graphs. In this paper, we prove that the cardinality $N i (n)$ of this set is very…

math.CO2025

Settling the no- $(k + 1)$ -in-line problem when $k$ 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 $n \times n$ square lattice such that no $k + 1$ of them are in a line? This has been asked more than $100$ years ag…

math.CO2022

Towards characterizing the 2-Ramsey equations of the form $a x + b y = p (z)$

Zsolt Baja, Dániel Dobák, Benedek Kovács +2

In this paper, we study a Ramsey-type problem for equations of the form $a x + b y = p (z)$ . We show that if certain technical assumptions hold, then any 2-colouring of the positive integ…

Code-based [3,1]-avoiders in finite affine spaces AG(n,2)

The generalized trifference problem

Cardinalities of the total number of independent sets

Settling the no-(k+1)-in-line problem when k is not small

Towards characterizing the 2-Ramsey equations of the form ax+by=p(z)

Code-based $[3, 1]$ -avoiders in finite affine spaces $AG (n, 2)$

Settling the no- $(k + 1)$ -in-line problem when $k$ is not small

Towards characterizing the 2-Ramsey equations of the form $a x + b y = p (z)$