Robert Scheidweiler

  • Citations Per Year
Learn More
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)
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)
  • 1