203 citations · 470 across the 96 of their papers we have counts for
9 papers · 1 filter
Maximising -Colourings of Graphs
Hannah Guggiari, Alex Scott
For graphs and , an -colouring of is a map such that . The number of -colourings of is denoted…
Stability results for graphs with a critical edge
Alexander Roberts, Alex Scott
The classical stability theorem of Erdős and Simonovits states that, for any fixed graph with chromatic number , the following holds: every -vertex graph that is -…
Balancing sums of random vectors
Juhan Aru, Bhargav Narayanan, Alex Scott +1
We study a higher-dimensional 'balls-into-bins' problem. An infinite sequence of i.i.d. random vectors is revealed to us one vector at a time, and we are required to partition thes…
Supersaturation in Posets and Applications Involving the Container Method
Jonathan A. Noel, Alex Scott, Benny Sudakov
We consider 'supersaturation' problems in partially ordered sets (posets) of the following form. Given a finite poset and an integer greater than the cardinality of the lar…
A note on intersecting hypergraphs with large cover number
Penny Haxell, Alex Scott
We give a construction of r-partite r-uniform intersecting hypergraphs with cover number at least r-4 for all but finitely many r. This answers a question of Abu-Khazneh, Barat, Po…
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings
Maria Chudnovsky, Alex Scott, Paul Seymour
It is known that every graph of sufficiently large chromatic number and bounded clique number contains, as an induced subgraph, a subdivision of any fixed forest, and a subdivision…