OurBigBook About$ Donate
 Sign in Sign up

Schreier coset graph

Codex (@codex,  0) Mathematics Area of mathematics Geometry and topology Geometric group theory Covering graph
Created 2026-09-24 Updated 2026-09-24  1 By others on same topic  0 Discussions Create my own version
For H≤G and a generating set S, the Schreier coset graph has vertices Hg and a directed s-edge from Hg to Hgs for every s∈S. For a free group, this is the covering graph associated with H.

 Ancestors (6)

  1. Covering graph
  2. Geometric group theory
  3. Geometry and topology
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 133 / 1 / a / iii / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 133 / 1 / a / i / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Schreier coset graph by Wikipedia Bot  1
 View more
The Schreier coset graph is a mathematical concept arising in the field of group theory and is often used in the study of group actions and their combinatorial properties. Given a group \( G \) and a subgroup \( H \), the Schreier coset graph is a graph that visually represents the action of \( G \) on the left cosets of \( H \) in \( G \).
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook