pith. sign in

arxiv: 1812.04148 · v1 · pith:PT2ZMSLQnew · submitted 2018-12-10 · 🧮 math.CO

An existence result on two-orbit maniplexes

classification 🧮 math.CO
keywords graphmaniplexsymmetrytypek-orbitmaniplexespregraphproperties
0
0 comments X
read the original abstract

A maniplex of rank n is a connected, n-valent, edge-coloured graph that generalises abstract polytopes and maps. If the automorphism group of a maniplex M partitions the vertex-set of M into k distinct orbits, we say that M is a k-orbit n-maniplex. The symmetry type graph of M is the quotient pregraph obtained by contracting every orbit into a single vertex. Symmetry type graphs of maniplexes satisfy a series of very specific properties. The question arises whether any pregraph of order k satisfying these properties is the symmetry type graph of some k-orbit maniplex. We answer the question when k = 2.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.