Felix Joos

activity

20132025

most citedOn a rainbow version of Dirac's theorem

47 citations · 178 across the 44 of their papers we have counts for

collaborators

Showing 2016Show all

5 papers · 1 filter

math.CO2016★ 3 cited

Percolation on random graphs with a fixed degree sequence

Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau

We consider bond percolation on random graphs with given degrees and bounded average degree. In particular, we consider the order of the largest component after the random deletion…

math.CO2016★ 2 cited

Long cycles have the edge-Erdős-Pósa property

Henning Bruhn, Matthias Heinlein, Felix Joos

We prove that the set of long cycles has the edge-Erdős-Pósa property: for every fixed integer $ℓ \geq 3$ and every $k \in N$ , every graph $G$ either contains $k$ edge-disj…

math.CO2016

Optimal packings of bounded degree trees

Felix Joos, Jaehoon Kim, Daniela Kühn +1

We prove that if $T_{1}, \dots, T_{n}$ is a sequence of bounded degree trees so that $T_{i}$ has $i$ vertices, then $K_{n}$ has a decomposition into $T_{1}, \dots, T_{n}$ . This shows that the tr…

math.CO2016★ 20 cited

A unified Erdős-Pósa theorem for constrained cycles

Tony Huynh, Felix Joos, Paul Wollan

A doubly group-labeled graph is an oriented graph with its edges labeled by elements of the direct sum of two groups $Γ_{1}, Γ_{2}$ . A cycle in a doubly group-labeled graph is $(Γ_1,Γ_2…

math.CO2016★ 18 cited

How to determine if a random graph with a fixed degree sequence has a giant component

Felix Joos, Guillem Perarnau, Dieter Rautenbach +1

For a fixed degree sequence $D = (d_{1}, ..., d_{n})$ , let $G (D)$ be a uniformly chosen (simple) graph on ${1, ..., n}$ where the vertex $i$ has degree $d_{i}$ . In this p…