3 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.CO2020
Maker-Breaker Games on Random Hypergraphs
Maxime Larcher
In this paper, we study Maker-Breaker games on the random hypergraph , obtained from the complete -graph by keeping every edge independently with probability . We…
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 edge-disjoint cycles. This has been confirmed for some spec…