39 citations · 89 across the 25 of their papers we have counts for
6 papers · 1 filter
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…
Reconstructibility of the -count from cards
Charlotte Knierim, Anders Martinsson
The Reconstruction Conjecture of Kelly and Ulam states that any graph with vertices can be reconstructed from the multiset of unlabelled subgraphs $G…
A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method
Anders Martinsson
We show that any triangle-free graph with maximum degree has chromatic number at most
Arithmetic Progressions in Sumsets of Sparse Sets
Noga Alon, Ryan Alweiss, Yang P. Liu +2
A set of positive integers is \emph{log-sparse} if there is an absolute constant so that for any positive integer the sequence contains at most…
Note on Long Paths in Eulerian Digraphs
Charlotte Knierim, Maxime Larcher, Anders Martinsson
Long Paths and Cycles in eulerian digraphs have gotten a lot of attention recently. In this short note, we show how to use methods from Knierim, Larcher, Martinsson, Noever (2021)…
Solving Static Permutation Mastermind using Queries
Maxime Larcher, Anders Martinsson, Angelika Steger
Permutation Mastermind is a version of the classical mastermind game in which the number of positions is equal to the number of colors , and repetition of colors is not allo…