Balázs Patkós

collaborators

5 papers

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

Poset saturation of unions of chains

Shengjin Ji, Balázs Patkós, Erfei Yue

A family $G$ of sets is a(n induced) copy of a poset $P = (P, ⩽)$ if there exists a bijection $b : P \to G$ such that $p ⩽ q$ holds if and only…

math.CO2025

Bipartite Turán number of trees

Yair Caro, Balázs Patkós, Zsolt Tuza

We start a systematic investigation concerning bipartite Turán number for trees. For a graph $F$ and integers $1 \leq a \leq b$ we define: $(i)$ \quad $e x_{b} (a, b, F)$ is the largest…

math.CO2025

Size, diversity, minimum degree, sturdiness, dömdödöm

Balázs Patkós

For a family $F$ of sets and a disjoint pair $A, B$ we let $F (A, B) = {F \in F : A \subseteq F, B \cap F = \emptyset}$ . The \textbf{ $(p, q)$ -dömdöd…

math.CO2024

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…

Finding the diameter of a tree with distance queries

Poset saturation of unions of chains

Bipartite Turán number of trees

Size, diversity, minimum degree, sturdiness, dömdödöm

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