1 citations · 1 across the 11 of their papers we have counts for
10 papers · 1 filter
Proof of the KAMAK tree conjecture
Micha Christoph, Raphael Steiner
There are many intriguing questions in extremal graph theory that are well-understood in the undirected setting and yet remain elusive for digraphs. A natural instance of such a pr…
Fractional chromatic number vs. Hall ratio
Raphael Steiner
Given a graph , its Hall ratio forms a natural lower bound on its fractional chromatic number . A recent line of research s…
On the difference between the chromatic and cochromatic number
Raphael Steiner
The cochromatic number of a graph is the smallest number of colors in a vertex-coloring of such that every color class forms an independent set or a clique. In three…
Topological Minors in Typical Lifts
Matija Bucić, Micha Christoph, Alp Müyesser +1
An -lift of a graph is any graph obtained by replacing every vertex of with an independent set of size , and connecting every pair of two such independent sets…
Optimal bounds for zero-sum cycles. I. Odd order
Rutger Campbell, J. Pascal Gollin, Kevin Hendrey +1
For a finite (not necessarily Abelian) group , let denote the smallest positive integer such that for every labelling of the arcs of the comple…
Improved bounds for zero-sum cycles in
Micha Christoph, Charlotte Knierim, Anders Martinsson +1
For a finite Abelian group , let denote the smallest positive integer such that for each labelling of the arcs of the complete digraph of order using elements…