#### Filter Results:

- Full text PDF available (1)

#### Publication Year

2011

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Robert Scheidweiler, Eberhard Triesch
- SIAM J. Discrete Math.
- 2013

More than 30 years ago, Karp conjectured that all nontrivial monotone graph properties are evasive, i.e., have decision tree complexity (n 2 ) , where n is the number of vertices. It was proved in 1984 by Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306] if n is a prime power by a topological approach. Using their method, we prove a lower… (More)

- Robert Scheidweiler, Eberhard Triesch
- Discrete Mathematics
- 2014

- Isabel Beckenbach, Robert Scheidweiler
- Discrete Mathematics
- 2017

- Robert Scheidweiler, Eberhard Triesch
- CTW
- 2011

cover in H. Berge and Las Vergnas (Annals of the New York Academy of Science, 175, 1970, 32-40) proved what may be called Kőnig’s Theorem for balanced hypergraphs, namely gd(H) = τd(H) for all weight functions d : E → N Conforti, Cornuéjols Kapoor and Vušković (Combinatorica, 16, 1996, 325-329) proved that the existence of a perfect matching is equivalent… (More)

- Robert Scheidweiler, Eberhard Triesch
- CTW
- 2012

- Robert Scheidweiler, Eberhard Triesch
- J. Comb. Optim.
- 2016

- ‹
- 1
- ›