Corpus ID: 222310779

Up to a double cover, every regular connected graph is isomorphic to a Schreier graph

@article{Leemann2020UpTA,
  title={Up to a double cover, every regular connected graph is isomorphic to a Schreier graph},
  author={P. Leemann},
  journal={arXiv: Combinatorics},
  year={2020}
}
  • P. Leemann
  • Published 13 October 2020
  • Mathematics
  • arXiv: Combinatorics
We prove that every connected locally finite regular graph has a double cover which is isomorphic to a Schreier graph. 

Figures from this paper

Integrable and Chaotic Systems Associated with Fractal Groups
TLDR
This paper provides calculation and analysis of multi-dimensional rational maps arising via the Schur complement in some important examples, including the first group of intermediate growth and its overgroup, and contains a discussion of the dichotomy “integrable-chaotic” in the considered model, and suggests a possible probabilistic approach to studying the discussed problems. Expand

References

SHOWING 1-10 OF 10 REFERENCES
Every connected regular graph of even degree is a Schreier coset graph
  • J. Gross
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. B
  • 1977
TLDR
Using Petersen's theorem, that every regular graph of even degree is 2-factorable, it is proved that every connected regular graph is isomorphic to a Schreier coset graph. Expand
König's Duality Theorem for Infinite Bipartite Graphs
Dans tout graphe biparti il existe un couplage N et un recouvrement P tel que P consiste en un choix de 1 sommet a partir d'une arete dans N
Schreir graphs: Transitivity and coverings
  • P. Leemann
  • Computer Science, Mathematics
  • Int. J. Algebra Comput.
  • 2016
TLDR
A characterization of isomorphisms between Schreier graphs in terms of the groups, subgroups and generating systems allows us to give a transitivity criterion for Schreiers graphs and shows that Tarski monsters satisfy a strong simplicity criterion. Expand
Algebraic Graph Theory
TLDR
The Laplacian of a Graph and Cuts and Flows are compared to the Rank Polynomial. Expand
Every finite non-solvable group admits an oriented regular representation
TLDR
It is shown that every finite non-solvable group admits an ORR, and a tool is provided that may prove useful in showing that some families of finite solvable groups admit ORRs. Expand
Discrete groups, expanding graphs and invariant measures
  • A. Lubotzky
  • Mathematics, Computer Science
  • Progress in mathematics
  • 1994
TLDR
The Banach-Ruziewicz Problem for n = 2, 3 Ramanujan Graphs is solved and the representation theory of PGL 2 is explained. Expand
of Group Actions on Rooted Trees
We prove a general result about the decomposition into ergodic components of group actions on boundaries of spherically homogeneous rooted trees. Namely, we identify the space of ergodic componentsExpand
On subgroups and Schreier graphs of finitely generated groups
Le sujet de cette these est la theorie geometrique et combinatoire des groupes - le lien entre les proprietes des groupes et celles des objets geometriques sur lesquels ils agissent. PlusExpand
Algebraic graph theory, volume 207 of Graduate Texts in Mathematics
  • 2001