OFFSET
0,10
COMMENTS
A graph G is induced H-saturated if there exists no induced subgraph H in G, but for every edge e in the complement of G, the graph G+e has an induced subgraph H. We consider the complete graph K_n to be the trivial case. This is an empirical observation verified via a computer program.
Note that for n=11, the runtime is about 4 days.
LINKS
Craig M. Tennenhouse, Induced Subgraph Saturated Graphs, Theory and Applications of Graphs (2016) Vol. 3: Iss. 2, Article 1.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Mason Nakamura, Evan Sabini, Xuwen Hua, Jared Glassband, Kathleen Ryan, Brian G. Kronenthal, Jul 30 2021
STATUS
approved