Premaniplexes of rank 3 and 4 as symmetry type graphs of maniplexes
Maruša Lekše
Abstract
We show that every finite premaniplex of rank 3 or 4 is the symmetry type graph of a finite maniplex, settling the finite rank 3 and 4 case of the maniplex version of the symmetry type graph problem. The proof uses the fact that the universal string Coxeter groups of rank 3 and 4 are amalgams (of finite groups), hence they act on a tree, which allows us to use a lifting theorem of Potočnik and Spiga.
Create a lesson
Related papers
On P4-intersecting families of graphs
Jie Han, Bin Wang
A base-8 upper bound for planar peeling sequences
André Hisatsuga, Griffin Johnston, Rafael Miyazaki
Spanning subhypergraphs with degree constraints
Noga Alon, Penny Haxell, Aleksa Milojević et al.
Invariance of rowmotion for variants of the Tamari lattice
Ben Adenbaum, Emily Barnard, Cesar Ceballos et al.
A 4AP-free permutation of the positive integers
Boon Suan Ho
Degreewise Cut-Semigroup Saturation for K5-Minor-Free Graphs and Seymour's Planar Edge-Colouring Conjecture
SeungJu Lee