Charlotte Knierim

activity

20182026

most cited

K_{r}

-Factors in Graphs with Low Independence Number

1 citations · 1 across the 7 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2024

Improved bounds for zero-sum cycles in $Z_{p}^{d}$

Micha Christoph, Charlotte Knierim, Anders Martinsson +1

For a finite Abelian group $(Γ, +)$ , let $n (Γ)$ denote the smallest positive integer $n$ such that for each labelling of the arcs of the complete digraph of order $n$ using elements…

math.CO2022

Schur properties of randomly perturbed sets

Shagnik Das, Charlotte Knierim, Patrick Morris

A set $A$ of integers is said to be \emph{Schur} if any two-colouring of $A$ results in monochromatic $x, y$ and $z$ with $x + y = z$ . We study the following problem: how many random in…

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

math.CO2019★ 1 cited

$K_{r}$ -Factors in Graphs with Low Independence Number

Charlotte Knierim, Pascal Su

A classical result by Hajnal and Szemerédi from 1970 determines the minimal degree conditions necessary to guarantee for a graph to contain a $K_{r}$ -factor. Namely, any graph on $n$ …

math.CO2019

Long Cycles, Heavy Cycles and Cycle Decompositions in Digraphs

Charlotte Knierim, Maxime Larcher, Anders Martinsson +1

Hajós conjectured in 1968 that every Eulerian $n$-vertex graph can be decomposed into at most $⌊(n - 1) /2 ⌋$ edge-disjoint cycles. This has been confirmed for some spec…

math.CO2018

Improved bounds on the multicolor Ramsey numbers of paths and even cycles

Charlotte Knierim, Pascal Su

We study the multicolor Ramsey numbers for paths and even cycles, $R_{k} (P_{n})$ and $R_{k} (C_{n})$ , which are the smallest integers $N$ such that every coloring of the complete graph $K_N…

Improved bounds for zero-sum cycles in Zpd​

Schur properties of randomly perturbed sets

Hat guessing numbers of strongly degenerate graphs

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

Note on Long Paths in Eulerian Digraphs

Kr​-Factors in Graphs with Low Independence Number

Long Cycles, Heavy Cycles and Cycle Decompositions in Digraphs

Improved bounds on the multicolor Ramsey numbers of paths and even cycles

Improved bounds for zero-sum cycles in $Z_{p}^{d}$

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

$K_{r}$ -Factors in Graphs with Low Independence Number