Automorphism groups of graphs with forbidden subgraphs (Q1199116): Difference between revisions

For a graph \(G\) let \(F(G)\) be the class of finite graphs which do not contain an induced subgraph isomorphic to \(G\). If \(G\) is not isomorphic to a path on at most 4 vertices or to the complement of such a graph, then for every finite group \(H\) there is a graph \(\Gamma\) such that \(H\) is isomorphic to the automorphism group of \(\Gamma\). For all paths \(G\) on at most 4 vertices the automorphism groups of graphs in \(F(G)\) are described.