Showing 2019Show all
2 papers · 1 filter
math.CO2019
Majority Colorings of Sparse Digraphs
Michael Anastos, Ander Lamaison, Raphael Steiner +1
A majority coloring of a directed graph is a vertex-coloring in which every vertex has the same color as at most half of its out-neighbors. Kreutzer, Oum, Seymour, van der Zypen an…
math.CO2019
The random strategy in Maker-Breaker graph minor games
Ander Lamaison
In a biased Maker-Breaker game, how good a strategy is for a player can be measured by the bias range for which its rival can win, choosing an appropriate counterstrategy.…