Anders Martinsson

most citedTriangle-free

d

-degenerate graphs have small fractional chromatic number

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

collaborators

Showing math.COShow all

2 papers · 1 filter

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…

math.CO2024

Local Shearer bound

Anders Martinsson, Raphael Steiner

We prove the following local strengthening of Shearer's classic bound on the independence number of triangle-free graphs: For every triangle-free graph $G$ there exists a probabili…

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

Local Shearer bound

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