2 papers
math.CO2025
Lower Bounds for Induced-Universal Graphs
Cyril Gavoille, Amaury Jacques
We give a series of new lower bounds on the minimum number of vertices required by a graph to contain every graph of a given family as induced subgraph. In particular, we show that…
math.CO2024
A note on locating-dominating sets in twin-free graphs
Nicolas Bousquet, Quentin Chuet, Victor Falgas-Ravry +2
In this short note, we prove that every twin-free graph on vertices contains a locating-dominating set of size at most . This improves the earlier bou…