1 citations · 1 across the 6 of their papers we have counts for
6 papers
Universality for transversal Hamilton cycles in random graphs
Micha Christoph, Anders Martinsson, Aleksa Milojević
A tuple of graphs on the same vertex set of size is said to be Hamilton-universal if for every map there exists a Hamilton cycle whose -th e…
Triangle-free -degenerate graphs have small fractional chromatic number
Anders Martinsson
A well-known conjecture by Harris states that any triangle-free -degenerate graph has fractional chromatic number at most . This conjecture has ga…
Local Shearer bound
Anders Martinsson, Raphael Steiner
We prove the following local strengthening of Shearer's classic bound on the independence number of triangle-free graphs: For every triangle-free graph there exists a probabili…
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…
Resolution of the Kohayakawa-Kreuter conjecture
Micha Christoph, Anders Martinsson, Raphael Steiner +1
A graph is said to be Ramsey for a tuple of graphs if every -coloring of the edges of contains a monochromatic copy of in color , for some …
Vertex-critical graphs far from edge-criticality
Anders Martinsson, Raphael Steiner
Let be any positive integer. We prove that for every sufficiently large there exists a -chromatic vertex-critical graph such that for every set $R \subset…