Robert Scheidweiler

A Lower Bound for the Complexity of Monotone Graph Properties

More than 30 years ago, Karp conjectured that all nontrivial monotone graph properties are evasive, i.e., have decision tree complexity

On chordal graph and line graph squares

\binom{n}{2}

A note on the duality between matchings and vertex covers in balanced hypergraphs

, where

A Note on Edge Weightings Inducing Proper Vertex Colorings

n

Perfect f-matchings and f-factors in hypergraphs—A combinatorial approach

is the number of vertices. It was proved in 1984 by Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297--306] if

A flow based pruning scheme for enumerative equitable coloring algorithms

n

Matchings in balanced hypergraphs

is a prime power by a topological approach. Using their method, we prove a lower bound of

New estimates for the gap chromatic number

\frac{1}{3}n^2-o(n^2)

A Combinatorial Proof of a König-type Theorem for Unimodular Hypergraphs

for general

Ganzzahlige Optimierungsmethoden für die operative Planung von Erhaltungsmaßnahmen im Straßenbau

n