18 citations · 31 across the 33 of their papers we have counts for
4 papers · 1 filter
Counterexamples to conjectures on the occupancy fraction of graphs
Stijn Cambie, Jorik Jooken
The occupancy fraction of a graph is a (normalized) measure on the size of independent sets under the hard-core model, depending on a variable (fugacity) We present a criterio…
The maximum number of connected sets in regular graphs
Stijn Cambie, Jan Goedgebeur, Jorik Jooken
We improve the best known lower bounds on the exponential behavior of the maximum of the number of connected sets, , and dominating connected sets, , for regular…
Improved asymptotic upper bounds for the minimum number of pairwise distinct longest cycles in regular graphs
Jorik Jooken
We study how few pairwise distinct longest cycles a regular graph can have under additional constraints. For each integer , we give exponential improvements for the best…
Critical -Free Graphs
Wen Xia, Jorik Jooken, Jan Goedgebeur +1
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to nor . Let be the path on vertices. A dart is the…