Characterization of sparse monotone graph classes with bounded domination-to-2-independence ratio
Combinatorics
2026-01-22 v1
Abstract
We give an exact characterization of monotone graph classes C with bounded average degree that satisfy the following property: The domination number of every graph from C is bounded by a linear function of its 2-independence number.
Keywords
Cite
@article{arxiv.2601.15082,
title = {Characterization of sparse monotone graph classes with bounded domination-to-2-independence ratio},
author = {Marthe Bonamy and Zdeněk Dvořák and Lukas Michel and David Mikšaník},
journal= {arXiv preprint arXiv:2601.15082},
year = {2026}
}
Comments
14 pages, no figures