14 citations · 66 across the 66 of their papers we have counts for
5 papers · 1 filter
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…
Hadwiger's conjecture implies a conjecture of Füredi-Gyárfás-Simonyi
Stijn Cambie
One of the most important open problems in the field of graph colouring or even graph theory is the conjecture of Hadwiger. This conjecture was the inspiration for many mathematica…
Extremal Binary PFAs with Small Number of States
Stijn Cambie, Michiel de Bondt, Henk Don
The largest known reset thresholds for DFAs are equal to , where is the number of states. This is conjectured to be the maximum possible. PFAs (with partial transition…
On the relationship between variable Wiener index and variable Szeged index
Stijn Cambie, John Haslegrave
We resolve two conjectures of Hriňáková, Knor and Škrekovski (2019) concerning the relationship between the variable Wiener index and variable Szeged index for a connected, non-com…
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…