Anna Johnsen

collaborators

2 papers

math.CO2022

Embedding Irregular Colorings into Connected Factorizations

Amin Bahmanian, Anna Johnsen

For $r := (r_{1}, \dots, r_{k})$ , an $r$ -factorization of the complete $λ$ -fold $h$ -uniform $n$ -vertex hypergraph $λ K_{n}^{h}$ is a partition of (the edges of) $λ K_{n}^{h}$ into $F_{1}, \dots, F_{k}$ s…

math.CO2022

Existence of $2$ -Factors in Tough Graphs without Forbidden Subgraphs

Elizabeth Grimm, Songling Shan, Anna Johnsen

For a given graph $R$ , a graph $G$ is $R$ -free if $G$ does not contain $R$ as an induced subgraph. It is known that every $2$ -tough graph with at least three vertices has a $2$ -fac…

Embedding Irregular Colorings into Connected Factorizations

Existence of 2-Factors in Tough Graphs without Forbidden Subgraphs

Existence of $2$ -Factors in Tough Graphs without Forbidden Subgraphs