Anders Martinsson

activity

20232025

d

-degenerate graphs have small fractional chromatic number

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

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

Universality for transversal Hamilton cycles in random graphs

Micha Christoph, Anders Martinsson, Aleksa Milojević

A tuple $(G_{1}, \dots, G_{n})$ of graphs on the same vertex set of size $n$ is said to be Hamilton-universal if for every map $χ : [n] \to [n]$ there exists a Hamilton cycle whose $i$ -th e…

math.CO2025★ 1 cited

Triangle-free $d$ -degenerate graphs have small fractional chromatic number

Anders Martinsson

A well-known conjecture by Harris states that any triangle-free $d$ -degenerate graph has fractional chromatic number at most $O (\frac{d}{l n d})$ . This conjecture has ga…

Universality for transversal Hamilton cycles in random graphs

Triangle-free d-degenerate graphs have small fractional chromatic number

Triangle-free $d$ -degenerate graphs have small fractional chromatic number