J. Skokan

activity

20102026

most citedThe Ramsey number of the clique and the hypercube

13 citations · 74 across the 20 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023★ 1 cited

Graphs with large minimum degree and no small odd cycles are $3$ -colourable

Julia Böttcher, Nóra Frankl, Domenico Mergoni Cecchelli +2

Answering a question by Letzter and Snyder, we prove that for large enough $k$ any $n$ -vertex graph $G$ with minimum degree at least $\frac{1}{2 k - 1} n$ and without odd cycles of len…

math.CO2023★ 9 cited

Separating the edges of a graph by a linear number of paths

Marthe Bonamy, Fábio Botler, François Dross +2

Recently, Letzter proved that any graph of order $n$ contains a collection $P$ of $O (n lo g^{⋆} n)$ paths with the following property: for all distinct edges $e$ and $f$ …

Graphs with large minimum degree and no small odd cycles are 3-colourable

Separating the edges of a graph by a linear number of paths

Graphs with large minimum degree and no small odd cycles are $3$ -colourable