Frucht's theorem

English

Etymology

Proved by Robert Frucht in 1939.

Proper noun

Frucht's theorem

  1. (graph theory) The statement that every finite group is the group of symmetries of a finite undirected graph. More strongly, for any finite group G there exist infinitely many non-isomorphic simple connected graphs such that the automorphism group of each of them is isomorphic to G.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.