Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups
From MaRDI portal
Publication:2357224
DOI10.1016/j.ejc.2017.03.001zbMath1365.05127arXiv1609.00591OpenAlexW2963431093MaRDI QIDQ2357224
Publication date: 19 June 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.00591
Reflection and Coxeter groups (group-theoretic aspects) (20F55) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (3)
Hypercube embeddings and Cayley graphs generated by transpositions ⋮ Linear time algorithms on mirror trees ⋮ Characterization of 2-arc-transitive partial cubes
Cites Work
- Unnamed Item
- Unnamed Item
- There are no finite partial cubes of girth more than 6 and minimum degree at least 3
- Antipodal graphs and oriented matroids
- Isometric embedding in products of complete graphs
- Cubic inflation, mirror graphs, regular maps, and partial cubes
- COMs: complexes of oriented matroids
- A characterization of oriented matroids in terms of topes
- Axioms for maximal vectors of an oriented matroid: A combinatorial characterization of the regions determined by an arrangement of pseudohyperplanes
- Distance-preserving subgraphs of hypercubes
- Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles
- Convex cycle bases
- On a Class of Fixed-Point-Free Graphs
- Classification of Vertex‐Transitive Cubic Partial Cubes
- Oriented Matroids
- The Complete Enumeration of Finite Groups of the Form Ri2=(RiRj)kij=1
This page was built for publication: Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups
