This article includes inline citations, but they are not properly formatted. Please improve this article by correcting them.(May 2024) (Learn how and when to remove this message)
In the area of mathematics called combinatorial group theory, the Schreier coset graph is a graph associated with a group G, a generating set S={si : i in I} of G, and a subgroup H ≤ G. The Schreier graph encodes the abstract structure of a group modulo an equivalence relation formed by the coset.
The graph is named after Otto Schreier, who used the term "Nebengruppenbild".[1] An equivalent definition was made in an early paper of Todd and Coxeter.[2]
^Schreier, Otto (December 1927). "Die Untergruppen der freien Gruppen". Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 5 (1): 161–183. doi:10.1007/BF02952517.
^Todd, J.A; Coxeter, H.S.M. (October 1936). "A practical method for enumerating cosets of a finite abstract group". Proceedings of the Edinburgh Mathematical Society. 5 (1): 26–34. doi:10.1017/S0013091500008221. Retrieved 2018-03-05.
and 8 Related for: Schreier coset graph information
right cosets of a fixed subgroup H , {\displaystyle H,} one obtains a related construction, the Schreiercosetgraph, which is at the basis of coset enumeration...
Schreier–Sims algorithm Schreier cosetgraphSchreier conjecture Schreier domain O'Connor, John J.; Robertson, Edmund F., "Otto Schreier", MacTutor History of Mathematics...
of circles, namely to the Schreiercosetgraph of F/H. This can be used to give a topological proof of the Nielsen-Schreier theorem above. The groupoid...
Mersenne Twister Coloring algorithm: Graph coloring algorithm. Hopcroft–Karp algorithm: convert a bipartite graph to a maximum cardinality matching Hungarian...
taken to mean that the Cheeger constant of the family of their Schreiercosetgraphs (with respect to a fixed generating set for Γ {\displaystyle \Gamma...
{\displaystyle e(G,H)} as the number of ends of the relative Cayley graph (the Schreiercosetgraph) of G {\displaystyle G} with respect to H {\displaystyle H}...
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);...
Global Information