Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Automorphism groups of trees and graphs II

Description

This lecture delves into the uniqueness of trees and the automorphism groups of trees and graphs, focusing on the local action and prune content. The instructor discusses Cayley-Abels graphs, vertex stabilizers, and constructing vertex-transitive subgroups with prescribed local actions. The lecture also covers the compactness of automorphism groups, point stabilizers, and the local prime content of tdlc groups. Various theorems and exercises are presented, including the relationship between dihedral groups and Cayley-Abels graphs. The content concludes with insights into legal colorings of trees and the Burger-Mozes universal group.

Official source

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Algebra: Representation theory

Related concepts (32)

List of graphs

This partial list of graphs contains definitions of graphs and graph families. For collected definitions of graph theory terms that do not refer to individual graph types, such as vertex and path, see Glossary of graph theory. For links to existing articles about particular kinds of graphs, see . Some of the finite structures considered in graph theory have names, sometimes inspired by the graph's topology, and sometimes after their discoverer.

Outer automorphism group

In mathematics, the outer automorphism group of a group, G, is the quotient, Aut(G) / Inn(G), where Aut(G) is the automorphism group of G and Inn(G) is the subgroup consisting of inner automorphisms. The outer automorphism group is usually denoted Out(G). If Out(G) is trivial and G has a trivial center, then G is said to be complete. An automorphism of a group that is not inner is called an outer automorphism. The cosets of Inn(G) with respect to outer automorphisms are then the elements of Out(G); this is an instance of the fact that quotients of groups are not, in general, (isomorphic to) subgroups.

Inner automorphism

In abstract algebra an inner automorphism is an automorphism of a group, ring, or algebra given by the conjugation action of a fixed element, called the conjugating element. They can be realized via simple operations from within the group itself, hence the adjective "inner". These inner automorphisms form a subgroup of the automorphism group, and the quotient of the automorphism group by this subgroup is defined as the outer automorphism group.

Chordal graph

In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not part of the cycle but connects two vertices of the cycle. Equivalently, every induced cycle in the graph should have exactly three vertices. The chordal graphs may also be characterized as the graphs that have perfect elimination orderings, as the graphs in which each minimal separator is a clique, and as the intersection graphs of subtrees of a tree.

Petersen graph

In the mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful example and counterexample for many problems in graph theory. The Petersen graph is named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring. Although the graph is generally credited to Petersen, it had in fact first appeared 12 years earlier, in a paper by .

Related lectures (28)

Automorphism Groups: Trees and Graphs III

Explores automorphism groups of trees and graphs, including actions on trees and group homomorphisms.

Automorphism groups: Trees and Graphs

Explores automorphism groups in trees and graphs, focusing on ends and types of automorphisms.

Automorphism groups of trees and graphs

Explores automorphisms of graphs, focusing on automorphism groups, Cayley-Abels graphs, and quasi-isometry.

Endomorphisms and automorphisms of totally disconnected locally compact groups I

Covers the definitions and basic results of endomorphisms and automorphisms of totally disconnected locally compact groups.

Graphs: Properties and Representations