14 citations · 66 across the 66 of their papers we have counts for
11 papers · 1 filter
Resolution of two conjectures by Erdős and Hall concerning separable numbers
Stijn Cambie, Wouter van Doorn
Erdős and Hall defined a pair of positive integers to be interlocking, if between any pair of consecutive divisors (both larger than ) of (resp. ) there is a div…
On the extrema of the mean subtree order of graphs
Stijn Cambie, Jorik Jooken, Stephan Wagner
It has been conjectured that the minimum and maximum of the mean subtree order among connected graphs of order are attained by the path and clique , respectively. Ex…
Proving it is impossible; on Erdős problem
Stijn Cambie
Erdős and Graham asked for the minimum density missed by one chosen residue class for each of a prescribed collection of moduli. We give exact expressions for natural structured fa…
Note on extremal problems about connected subgraph sums
Stijn Cambie, Carla Groenland
For a graph with vertex assignment , we define for a connected subgraph of as a connected subgraph sum of . We study t…
Uniform Šoltés' hypergraphs and Šoltés' weighted graphs
Stijn Cambie, Ajay Tiwari
A Šoltés' hypergraph is a hypergraph for which the removal of any of its vertices does not change its total distance. We prove that every uniform Šoltés' hypergraph has order at le…
Reconfiguration of List Colourings
Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston +2
Given a proper (list) colouring of a graph , a recolouring step changes the colour at a single vertex to another colour (in its list) that is currently unused on its neighbours,…
On edge-colouring-games by Erdős, and Bensmail and Mc Inerney
Stijn Cambie, Michiel Provoost
We study two games proposed by Erdős, and one game by Bensmail and Mc Inerney, all sharing a common setup: two players alternately colour edges of a complete graph, or in the biase…
On the order of intersecting hypergraphs
Stijn Cambie, Jaehoon Kim, Hyunwoo Lee +2
Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In…
On Erdős problem
Stijn Cambie
We establish the order of the maximum length of an increasing sequence, bounded by , in which the largest prime divisor of the elements form a decreasing sequence.
Sharp results for the Erdős, Pach, Pollack and Tuza problem
Stijn Cambie, Jorik Jooken
We consider the Erdős, Pach, Pollack and Tuza problem, asking for the maximum diameter of a graph with given order , minimum degree and clique number at most . We solve t…
Resolution of Erdős' problems about unimodularity
Stijn Cambie
Letting be the density of the set of integers with exactly one divisor in , Erdős wondered if is unimodular for fixed . We prove this is false in ge…