Anders Martinsson

activity

20242026

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2026

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 $I ¨ : [n] \to [n]$ there exists a Hamilton cycle whose $i$ -th…

math.CO2025

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…

math.CO2024

Resolution of the Kohayakawa-Kreuter conjecture

Micha Christoph, Anders Martinsson, Raphael Steiner +1

A graph $G$ is said to be Ramsey for a tuple of graphs $(H_{1}, \dots, H_{r})$ if every $r$ -coloring of the edges of $G$ contains a monochromatic copy of $H_{i}$ in color $i$ , for some $i$ …

math.CO2024

Improved bounds for zero-sum cycles in $Z_{p}^{d}$

Micha Christoph, Charlotte Knierim, Anders Martinsson +1

For a finite Abelian group $(I^, +)$ , let $n (I^)$ denote the smallest positive integer $n$ such that for each labelling of the arcs of the complete digraph of order $n$ using elemen…

Universality for transversal Hamilton cycles in random graphs

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

Local Shearer bound

Resolution of the Kohayakawa-Kreuter conjecture

Improved bounds for zero-sum cycles in Zpd​

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

Improved bounds for zero-sum cycles in $Z_{p}^{d}$