Charlotte Knierim

activity

20182021

collaborators

4 papers

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

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

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

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