1 citations · 2 across the 6 of their papers we have counts for
12 papers
Set systems without a simplex, Helly hypergraphs and union-efficient families
Stijn Cambie, Nika Salia
We present equivalent formulations for concepts related to set families for which every subfamily with empty intersection has a bounded sub-collection with empty intersection. Here…
Resolution of Yan's conjecture on entropy of graphs
Stijn Cambie, Matteo Mazzamurro
The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized by the degree sum. In this paper, we characterize the connected graphs with given…
Extremal entropy for graphs with given size
Stijn Cambie, Matteo Mazzamurro
The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized by the degree sum. Its correct interpretation as a measure of uniformity of the d…
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…
Structure and colour in triangle-free graphs
N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg +3
Motivated by a recent conjecture of the first author, we prove that every properly coloured triangle-free graph of chromatic number contains a rainbow independent set of size $…
Regular Turán numbers and some Gan-Loh-Sudakov-type problems
Stijn Cambie, Rémi de Joannis de Verclos, Ross J. Kang
Motivated by a Gan-Loh-Sudakov-type problem, we introduce the regular Turán numbers, a natural variation on the classical Turán numbers for which the host graph is required to be r…