1 citations · 1 across the 11 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
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 on vertices. A distance query consists of two vertices , and the answer…
math.CO2025
Turán problems for simplicial complexes
Maria Axenovich, Dániel Gerbner, Dingyuan Liu +1
An abstract simplicial complex is a non-uniform hypergraph without isolated vertices, whose edge set is closed under taking subsets. The extremal number $\mathrm{ex}(n…