## A Stronger Bound for the Strong Chromatic Index

- H. Bruhn, Felix Joos
- MathematicsCombinatorics, probability & computing
- 10 April 2015

We prove χ′ s (G) ≤ 1.93 Δ(G)2 for graphs of sufficiently large maximum degree where χ′ s (G) is the strong chromatic index of G. This improves an old bound of Molloy and Reed. As a by-product, we… Expand

## On kissing numbers and spherical codes in high dimensions

- Matthew Jenssen, Felix Joos, Will Perkins
- Computer ScienceAdvances in Mathematics
- 7 March 2018

## Optimal packings of bounded degree trees

- Felix Joos, Jaehoon Kim, D. Kuhn, D. Osthus
- MathematicsJournal of the European Mathematical Society…
- 13 June 2016

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 tree packing… Expand

## A Unified Erdős–Pósa Theorem for Constrained Cycles

- T. Huynh, Felix Joos, Paul Wollan
- MathematicsComb.
- 23 May 2016

## On a rainbow version of Dirac's theorem

- Felix Joos, Jaehoon Kim
- MathematicsBulletin of the London Mathematical Society
- 3 October 2019

For a collection G={G1,⋯,Gs} of not necessarily distinct graphs on the same vertex set V , a graph H with vertices in V is a G ‐transversal if there exists a bijection ϕ:E(H)→[s] such that e∈E(Gϕ(e))… Expand

## Long cycles through prescribed vertices have the Erdős‐Pósa property

- H. Bruhn, Felix Joos, Oliver Schaudt
- MathematicsJournal of Graph Theory
- 1 March 2018

We prove that for every graph, any vertex subset S, and given integers k,ℓ : there are k disjoint cycles of length at least ℓ that each contain at least one vertex from S, or a vertex set of size… Expand

## A rainbow blow‐up lemma

- Stefan Glock, Felix Joos
- MathematicsRandom Structures & Algorithms
- 21 February 2018

We prove a rainbow version of the blow‐up lemma of Komlós, Sárközy, and Szemerédi for μn‐bounded edge colorings. This enables the systematic study of rainbow embeddings of bounded degree spanning… Expand

## Frames, A-Paths, and the Erdös-Pósa Property

- H. Bruhn, Matthias Heinlein, Felix Joos
- MathematicsSIAM J. Discret. Math.
- 10 July 2017

A key feature of Simonovits' proof of the classic Erdos--Posa theorem is a simple subgraph of the host graph, a frame, that determines the outcome of the theorem. We transfer this frame technique t...

## Independence and matching number in graphs with maximum degree 4

- Felix Joos
- MathematicsDiscrete Mathematics
- 2 December 2013

## Induced Matchings in Subcubic Graphs

- Felix Joos, D. Rautenbach, Thomas Sasse
- MathematicsSIAM Journal on Discrete Mathematics
- 4 December 2013

...

1

2

3

4

5

...