12 citations · 16 across the 6 of their papers we have counts for
6 papers · 1 filter
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…
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…
On the approximability of the burning number
Anders Martinsson
The burning number of a graph is the smallest number such that the vertices of can be covered by balls of radii . As computing the burning number of a…
Synchronizing random automata through repeated 'a' inputs
Anders Martinsson
In a recent article by Chapuy and Perarnau, it was shown that a uniformly chosen automaton on states with a -letter alphabet has a synchronizing word of length $O(\sqrt{n}\l…
Finding a good tree to burn
Anders Martinsson
The burning number of a graph is the smallest positive integer such that the vertex set of can be covered with balls of radii . A well-known conjectur…
Hat guessing numbers of strongly degenerate graphs
Charlotte Knierim, Anders Martinsson, Raphael Steiner
Assume players are placed on the vertices of a graph . The following game was introduced by Winkler: An adversary puts a hat on each player, where each hat has a colour…