Jonathan Rollin

activity

20122026

most citedConditions on Ramsey non-equivalence

1 citations · 1 across the 9 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

math.CO2018

The interval number of a planar graph is at most three

Guillaume Guégan, Kolja Knauer, Jonathan Rollin +1

The interval number of a graph $G$ is the minimum $k$ such that one can assign to each vertex of $G$ a union of $k$ intervals on the real line, such that $G$ is the intersection gr…

math.CO2018

Induced and Weak Induced Arboricities

Maria Axenovich, Philip Dörr, Jonathan Rollin +1

We define the induced arboricity of a graph $G$ , denoted by $ia (G)$ , as the smallest $k$ such that the edges of $G$ can be covered with $k$ induced forests in $G$ . This notio…