1 citations · 1 across the 7 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019★ 1 cited
-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 -factor. Namely, any graph on …
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…