collaborators

7 papers

math.CO2026

Solution of Erdős problem

Stijn Cambie

We prove that the size is , but can be arbitrarily large. This resolves Erdős problem .

math.CO2026

On the order-diameter ratio of girth-diameter cages

Stijn Cambie, Jan Goedgebeur, Jorik Jooken +1

For integers , a -cage (or simply girth-diameter cage) is a smallest -regular graph of girth and diameter (if it exists). The order of a -cage i…

math.CO2026

A general bound on

Stijn Cambie, Andrea Freschi

In this paper, we prove that for every and every graph with edges and no isolated vertices, the Ramsey number is at most . This settles a pro…

math.CO2026

Benjamini-Schramm convergence and subtrees of trees

Stijn Cambie, Stephan Wagner, Ruoyu Wang

In this paper, we study the asymptotic behaviour of the number of subtrees and the subtree density for a sequence of trees that converges in the Benjamini-Schramm sense. Benjamini-…

math.CO2026

Maximum ratio of (graph) irregularities

Stijn Cambie, Jionghua Chang

We estimate the maximum ratio between the - and -irregularity for graphs and trees of order , which are respectively bounded by and . This answers a…

math.CO2026

On the maximum product of distances of diameter point sets

Stijn Cambie, Arne Decadt, Yanni Dong +2

We consider a problem posed by Erdős, Herzog and Piranian on the maximum product of distances of a point set of order with a given diameter. We prove that it is sufficient to…