37 citations · 312 across the 39 of their papers we have counts for
3 papers · 1 filter
Lower bounds for Ramsey numbers as a statistical physics problem
Jurriaan Wouters, Aris Giotis, Ross Kang +2
Ramsey's theorem, concerning the guarantee of certain monochromatic patterns in large enough edge-coloured complete graphs, is a fundamental result in combinatorial mathematics. In…
Packing list-colourings
Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies +1
List colouring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list-colouring, we seek m…
Maximising line subgraphs of diameter at most
Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos +1
We wish to bring attention to a natural but slightly hidden problem, posed by Erdős and Nešetřil in the late 1980s, an edge version of the degree--diameter problem. Our main result…