A. Scott

activity

20062022

most citedMonochromatic cycles and the monochromatic circumference in 2-coloured graphs

5 citations · 15 across the 13 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

math.CO2022

Clique covers of H-free graphs

Tung Nguyen, Alex Scott, Paul Seymour +1

It takes $n^{2} /4$ cliques to cover all the edges of a complete bipartite graph $K_{n /2, n /2}$ , but how many cliques does it take to cover all the edges of a graph $G$ if $G$ has no $…

math.CO2022

Bipartite graphs with no $K_{6}$ minor

Maria Chudnovsky, Alex Scott, Paul Seymour +1

A theorem of Mader shows that every graph with average degree at least eight has a $K_{6}$ minor, and this is false if we replace eight by any smaller constant. Replacing average deg…

math.CO2022

Polynomial bounds for chromatic number VII. Disjoint holes

Maria Chudnovsky, Alex Scott, Paul Seymour +1

A hole in a graph $G$ is an induced cycle of length at least four, and a $k$ -multihole in $G$ is a set of pairwise disjoint and nonadjacent holes. It is well known that if $G$ does…

Clique covers of H-free graphs

Bipartite graphs with no K6​ minor

Polynomial bounds for chromatic number VII. Disjoint holes

Bipartite graphs with no $K_{6}$ minor