## Realizing groups as automorphism groups of graphs.

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Frucht showed that every finite group is the automorphism group of a finite graph. The paper is here.
The argument basically is that a group is the automorphism group of its (colored) Cayley graph and that the colors of edge in the Cayley graph can be coded into an uncolored graph that has the same automorphism group.

This argument seems to carry over to the countably infinite case.
Does anybody know a reference for this?

In the uncountable, is it true that every group is the automorphism group of a graph? (Reference?) It seems like one has to code ordinals into rigid graphs in order to code the uncountably many colors of the Cayley graph.

-

## 2 Answers

According to the wikipedia page, every group is indeed the automorphism group of some graph. This was proven independently in

de Groot, J. (1959), Groups represented by homeomorphism groups, Mathematische Annalen 138

and

Sabidussi, Gert (1960), Graphs with given infinite group, Monatshefte für Mathematik 64: 64–67.

-

Thanks.  I somehow missed that wikipedia page.  I only found the one with the Frucht graph and related paper. – Stefan Geschke Sep 1 2010 at 8:37
From de Groot's paper you can see that this argument you described goes pretty far, for graphs, topological spaces etc. Coding arbitrary number of colors is done through some rigid spaces with no automorphisms. – Gjergji Zaimi Sep 1 2010 at 8:53
Yes, Stefan certainly had the right idea in mind.  I'll just remark that Sabidussi's paper meets my requirements for recreational math reading; it's only three pages long.   – Tony Huynh Sep 1 2010 at 9:10

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

In the topological setting or if you want to relate the size of the graph to the size of the group, there are two relevant results:

(1) Any closed subgroup of $S_\infty$, i.e., of the group of all (not just finitary) permutations of $\mathbb N$, is topologically isomorphic to the automorphism group of a countable graph.

(2) The abstract group of increasing homeomorphisms of $\mathbb R$, ${\rm Homeo}_+(\mathbb R)$, has no non-trivial actions on a set of size $<2^{\aleph_0}$. So in particular, it cannot be represented as the automorphism group of a graph with less than continuum many vertices.

-

1
Hi Christian! Nice to see you here. – Andres Caicedo Sep 1 2010 at 17:04
Hi Christian! Nice to see you! I fixed a small typo in your post. – François G. Dorais♦ Sep 1 2010 at 17:47
This is interesting, thank you. – Stefan Geschke Sep 2 2010 at 8:52
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 5, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9160827994346619, "perplexity_flag": "middle"}