Charlotte Knierim

activity

20182026

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

Hat guessing numbers of strongly degenerate graphs

Charlotte Knierim, Anders Martinsson, Raphael Steiner

Assume $n$ players are placed on the $n$ vertices of a graph $G$ . The following game was introduced by Winkler: An adversary puts a hat on each player, where each hat has a colour…

math.CO2021

Reconstructibility of the $K_{r}$ -count from $n - 1$ cards

Charlotte Knierim, Anders Martinsson

The Reconstruction Conjecture of Kelly and Ulam states that any graph $G$ with $n \geq 3$ vertices can be reconstructed from the multiset $D (G)$ of unlabelled subgraphs $G…

math.CO2021

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)…

Hat guessing numbers of strongly degenerate graphs

Reconstructibility of the Kr​-count from n−1 cards

Note on Long Paths in Eulerian Digraphs

Reconstructibility of the $K_{r}$ -count from $n - 1$ cards