14 citations · 66 across the 66 of their papers we have counts for
10 papers · 1 filter
Abundancy of -\v Soltés' digraphs
Stijn Cambie
We prove the existence of infinitely many \v Soltés' digraphs, the digraph analogue of \v Soltés' graphs. We also give an example of a \v Soltés' digraph with trivial automorphism…
Sharp Bounds on Lengths of Linear Recolouring Sequences
Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston
A recolouring sequence, between -colourings and of a graph , transforms into by recolouring one vertex at a time, such that after each recolouring step we aga…
Partitions of planar (oriented) graphs into a connected acyclic and an independent set
Stijn Cambie, François Dross, Kolja Knauer +2
A question at the intersection of Barnette's Hamiltonicity and Neumann-Lara's dicoloring conjecture is: Can every Eulerian oriented planar graph be vertex-partitioned into two acyc…
Open problems of the 32nd Workshop on Cycles and Colourings
János Barát, Stijn Cambie, Geňa Hahn +4
Since its beginnings, every Cycles and Colourings workshop holds one or two open problem sessions; this document contains the problems (together with notes regarding the current st…
Resolution of an Erdős' problem on least common multiples
Stijn Cambie
Erdős posed the question whether there exist infinitely many sets of consecutive numbers whose least common multiple (lcm) exceeds the lcm of another, larger set with greater conse…
Fractional list packing for layered graphs
Stijn Cambie, Wouter Cames van Batenburg
The fractional list packing number of a graph is a graph invariant that has recently arisen from the study of disjoint list-colourings. It measures how…
Hypergraph saturation for the bow tie
Stijn Cambie, Nika Salia
Erdős and Sós initiated the study of the maximum size of a -uniform set system, for , with no singleton intersections years ago. In this work, we investigate the…
Descents and inversions in powers of permutations
Stijn Cambie, Jun Yan
In this paper, we generalise several recent results by Archer and Geary on descents in powers of permutations, and confirm all their conjectures. Specifically, for all $k\in\mathbb…
Towards the essence of Šoltés' problem
Stijn Cambie
We explore the question asking for graphs for which the total distance decreases, possibly by a fixed constant , upon the removal of any of its vertices. We obtain results l…
Šoltés' hypergraphs
Stijn Cambie
More than years ago, Šoltés observed that the total distance of the graph does not change by deleting a vertex, and wondered about the existence of other such graphs,…