Trees and near-linear stable sets
Sign Up to like & getrecommendations! Published in 2024 at "Combinatorica"
DOI: 10.1007/s00493-025-00177-9
Abstract: When H is a forest, the Gyárfás-Sumner conjecture implies that every graph G with no induced subgraph isomorphic to H and with bounded clique number has a stable set of linear size. We cannot prove… read more here.
Keywords: trees near; stable set; near linear; linear stable ... See more keywords