Stijn Cambie

Orcid: 0000-0002-2385-1137

Affiliations:
  • KU Leuven, Belgium


According to our database1, Stijn Cambie authored at least 44 papers between 2019 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Note on extremal problems about connected subgraph sums.
Graphs Comb., April, 2026

The maximum Wiener index of a uniform hypergraph.
Discret. Math., 2026

Maximum ratio of (graph) irregularities.
Discret. Appl. Math., 2026

Abundancy of z -Šoltés' digraphs.
Discret. Appl. Math., 2026

Partitions of Planar (Oriented) Graphs into a Connected Acyclic and an Independent Set.
Electron. J. Comb., 2026

Sharp Bounds on Lengths of Linear Recolouring Sequences.
Electron. J. Comb., 2026

Towards the essence of Šoltés' problem.
Appl. Math. Comput., 2026

On the Order-Diameter Ratio of Girth-Diameter Cages.
Proceedings of the SOFSEM 2026: Theory and Practice of Computer Science, 2026

2025
Reconfiguration of List Colourings.
CoRR, May, 2025

On edge-colouring-games by Erdős, and Bensmail and Mc Inerney.
CoRR, May, 2025

Counterexamples to conjectures on the occupancy fraction of graphs.
Math. Comput., 2025

Packing Colourings in Complete Bipartite Graphs and the Inverse Problem for Correspondence Packing.
J. Graph Theory, 2025

The Average Solution of a TSP Instance in a Graph.
J. Graph Theory, 2025

The Maximum Number of Connected Sets in Regular Graphs.
Electron. J. Comb., 2025

On the main distance-based entropies: the eccentricity- and Wiener-entropy.
Ars Math. Contemp., 2025

2024
Decreasing the mean subtree order by adding <i>k</i> edges.
J. Graph Theory, March, 2024

Packing list-colorings.
Random Struct. Algorithms, January, 2024

When removing an independent set is optimal for reducing the chromatic number.
Eur. J. Comb., January, 2024

Optimally reconfiguring list and correspondence colourings.
Eur. J. Comb., January, 2024

Many Hamiltonian subsets in large graphs with given density.
Comb. Probab. Comput., January, 2024

A Precise Condition for Independent Transversals in Bipartite Covers.
SIAM J. Discret. Math., 2024

Extremal values of degree-based entropies of bipartite graphs.
Inf. Sci., 2024

Bounds and monotonicity of critical set parameters of colourings.
Discret. Math., 2024

Corrigendum on Wiener index, Zagreb Indices and Harary index of Eulerian graphs.
Discret. Appl. Math., 2024

List packing number of bounded degree graphs.
Comb. Probab. Comput., 2024

Fractional list packing for layered graphs.
CoRR, 2024

The Minimum Number of Maximal Independent Sets in Twin-Free Graphs.
Electron. J. Comb., 2024

Bounding Mean Orders of Sub-$k$-Trees of $k$-Trees.
Electron. J. Comb., 2024

2023
Maximum size of digraphs of given radius.
Discret. Math., August, 2023

Regular Turán numbers and some Gan-Loh-Sudakov-type problems.
J. Graph Theory, 2023

Extremal Binary PFAs with Small Number of States.
Int. J. Found. Comput. Sci., 2023

A proof of Frankl's conjecture on cross-union families.
Comb. Theory, 2023

2022
Extremal aspects of distances and colourings in graphs.
PhD thesis, 2022

Maximizing Line Subgraphs of Diameter at Most t.
SIAM J. Discret. Math., 2022

On the relationship between variable Wiener index and variable Szeged index.
Appl. Math. Comput., 2022

2021
Extremal total distance of graphs of given radius I.
J. Graph Theory, 2021

On the maximum mean subtree order of trees.
Eur. J. Comb., 2021

Five results on maximizing topological indices in graphs.
Discret. Math. Theor. Comput. Sci., 2021

Packing list-colourings.
CoRR, 2021

Structure and Colour in Triangle-Free Graphs.
Electron. J. Comb., 2021

Extremal Binary PFAs in a Černý Family.
Proceedings of the Developments in Language Theory - 25th International Conference, 2021

2020
An asymptotic resolution of a problem of Plesník.
J. Comb. Theory B, 2020

A Sauer-Shelah-Perles Lemma for Lattices.
Electron. J. Comb., 2020

2019
VC Dimension and a Union Theorem for Set Systems.
Electron. J. Comb., 2019


  Loading...