New Examples of Minimal Non-Strongly-Perfect Graphs
Combinatorics
2020-03-05 v1
Abstract
A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of forbidden induced subgraphs is not known. Here we provide several new minimal non-strongly-perfect graphs.
Cite
@article{arxiv.2003.01846,
title = {New Examples of Minimal Non-Strongly-Perfect Graphs},
author = {Maria Chudnovsky and Cemil Dibek and Paul Seymour},
journal= {arXiv preprint arXiv:2003.01846},
year = {2020}
}