Z. Füredi

activity

19992026

most citedExtremal numbers for odd cycles

45 citations · 106 across the 36 of their papers we have counts for

collaborators

45 papers

math.CO2026

Forbidden stars in multidimensional $0$ - $1$ matrices and visibility of lattice points

Zoltán Füredi, Balázs Keszegh, Paul Manuel

A $d$ -dimensional $0$ - $1$ matrix $M$ of size $n_{1} \times n_{2} \times \dots \times n_{d}$ can be considered as a Boolean function $M: B(n_1\times n_2\times \dots \times n_d) \to \{ 0,1\}…

math.CO2025

Clique number of xor-powers of Kneser graphs

Zoltán Füredi, András Imolay, Ádám Schweitzer

Let $f_{ℓ} (n, k)$ denote the clique number of the xor-product of $ℓ$ isomorphic Kneser graphs KG(n,k). Alon and Lubetzky investigated the case of complete graphs as a coding th…

math.CO2024

Triangle-free triple systems

Peter Frankl, Zoltán Füredi, Ido Goorevitch +2

There are four non-isomorphic configurations of triples that can form a triangle in a $3$ -uniform hypergraph. Forbidding different combinations of these four configurations, fiftee…

math.CO2023

Let $a, b \in Z^{+}$ , $r = a + b$ , and let $T$ be a tree with parts $U = {u_{1}, u_{2}, \dots, u_{s}}$ and $V = {v_{1}, v_{2}, \dots, v_{t}}$ . Let $U_{1}, \dots, U_{s}$ and $V_{1}, \dots, V_{t}$ be di…

math.CO2021★ 2 cited

An upper bound on the size of Sidon sets

József Balogh, Zoltán Füredi, Souktik Roy

In this entry point into the subject, combining two elementary proofs, we decrease the gap between the upper and lower bounds by $0.2%$ in a classical combinatorial number theory…

math.CO2020

Extremal problems for pairs of triangles

Zoltán Füredi, Dhruv Mubayi, Jason O'Neill +1

A convex geometric hypergraph or cgh consists of a family of subsets of a strictly convex set of points in the plane. There are eight pairwise nonisomorphic cgh's consisting of two…