4 papers
Effective Khovanskii, Ehrhart Polytopes, and the Erdős Multiplication Table Problem
Anna Margarethe Limbach, Robert Scheidweiler, Eberhard Triesch
Let be the set of products of factors from the set In 1955, Erdős posed the problem of determining the order of magnitude of and prove…
Upper and Lower Bounds for Competitive Group Testing
Robert Scheidweiler, Eberhard Triesch
We consider competitive algorithms for adaptive group testing problems. In the first part of the paper, we develop an algorithm with competitive constant c < 1.452 thus improving t…
On the Burning Number of -Caterpillars
Michaela Hiller, Eberhard Triesch, Arie M. C. A. Koster
The burning number is a recently introduced graph parameter indicating the spreading speed of content in a graph through its edges. While the conjectured upper bound on the necessa…
Matchings in balanced hypergraphs
Robert Scheidweiler, Eberhard Triesch
We give a new proof of König's theorem and generalize the Gallai-Edmonds decomposition to balanced hypergraphs in two different ways. Based on our decompositions we give two new ch…