Z. Nagy

collaborators

7 papers

math.CO2026

Chain Covers in the Boolean Lattice

Zoltán Lóránt Nagy, Balázs Patkós

For integers $1 \leq r \leq n + 1$ , let $N (n, r)$ denote the least number of chains in the Boolean lattice $B_{n} = 2^{[n]}$ that cover every strict $r$ -term chain. The case $r = 1$ is the clas…

math.CO2026

Cylinder type and $p$ -divisible sets in $F_{p}^{3}$

Gergely Kiss, Ádám Markó, Zoltán Lóránt Nagy +1

A set of points $S \subseteq F_{p}^{n}$ is called \emph{ $p$ -divisible} if every affine hyperplane in $F_{p}^{n}$ intersects $S$ in $0 (mod p)$ points. The Strong Cylinder…

math.CO2025

Bisection width, max-cut and internal partitions of 5-regular graphs

Endre Csóka, Panna Tímea Fekete, Zoltán Lóránt Nagy +1

In this paper, we present a new factor of IID process based on the local algorithm introduced by Díaz, Serna, and Wormald (2007). This new approach allows us to improve the previou…

math.CO2025

Randomised algebraic constructions for the no- $(k + 1)$ -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 $n \times n$ square lattice such that no $k + 1$ of them are collinear. The problem was f…

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…

Chain Covers in the Boolean Lattice

Cylinder type and p-divisible sets in Fp3​

Bisection width, max-cut and internal partitions of 5-regular graphs

Randomised algebraic constructions for the no-(k+1)-in-line problem

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

Cylinder type and $p$ -divisible sets in $F_{p}^{3}$

Randomised algebraic constructions for the no- $(k + 1)$ -in-line problem

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