M. Stiebitz

activity

20242026

collaborators

3 papers

math.CO2026

The Tournament Theorem of RÃ©dei revisited

Thomas Schweser, Michael Stiebitz, Bjarne Toft

In 1934 L. RÃ©dei published his famous theorem that the number of Hamiltonian paths in a tournament is odd. In fact it is a corollary of a stronger theorem in his paper. Stronger t…

math.CO2025

Generalized DP-colorings of digraphs

Lucas Picasarri-Arrieta, Michael Stiebitz

In this paper we consider the following three coloring concepts for digraphs. First of all, the generalized coloring concept, in which the same colored vertices of a digraph induce…

math.CO2024

Minimum number of arcs in $k$ -critical digraphs with order at most $2 k - 1$

Lucas Picasarri-Arrieta, Michael Stiebitz

The dichromatic number $I ¨ (D)$ of a digraph $D$ is the least integer $k$ for which $D$ has a coloring with $k$ colors such that there is no monochromatic directed cycle in $D$ .…

The Tournament Theorem of RÃ©dei revisited

Generalized DP-colorings of digraphs

Minimum number of arcs in k-critical digraphs with order at most 2k−1

Minimum number of arcs in $k$ -critical digraphs with order at most $2 k - 1$