Kartal Nagy

collaborators

3 papers

math.CO2025

A new intersection condition in extremal set theory

Kartal Nagy

We call a family $F$ $(3, 2, ℓ)$ -intersecting if $∣ A \cap B ∣ + ∣ B \cap C ∣ + ∣ C \cap A ∣ \geq ℓ$ for all $A$ , $B$ , $C \in F$ . We try to look for the maximum size…

cs.DS2025

Finding the diameter of a tree with distance queries

DÃ¡niel Gerbner, AndrÃ¡s Imolay, Kartal Nagy +2

We study the number of distance queries needed to identify certain properties of a hidden tree $T$ on $n$ vertices. A distance query consists of two vertices $x, y$ , and the answer…

math.CO2025

Identification of a monotone Boolean function with $k$ "reasons" as a combinatorial search problem

DÃ¡niel Gerbner, AndrÃ¡s Imolay, Gyula O. H. Katona +5

We study the number of queries needed to identify a monotone Boolean function $f : {0, 1}^{n} \to {0, 1}$ . A query consists of a 0-1-sequence, and the answer is the value of…

A new intersection condition in extremal set theory

Finding the diameter of a tree with distance queries

Identification of a monotone Boolean function with k "reasons" as a combinatorial search problem

Identification of a monotone Boolean function with $k$ "reasons" as a combinatorial search problem