6 papers · 1 filter
Markov chains of -oriented triangulations of surfaces
Adam Tyc
We consider triangulations of closed -dimensional (not necessarily orientable) surfaces. Any minimal set of zigzags that double covers the set of edges provides a -orientatio…
Maximal cliques in the graph of -ary simplex codes of dimension two
Mariusz Kwiatkowski, Andrzej Matraś, Mark Pankov +1
We consider the induced subgraph of the corresponding Grassmann graph formed by -ary simplex codes of dimension , . This graph contains precisely two types of maximal…
On -monodromies in embedded graphs
Adam Tyc
We characterize all permutations which realize as the -monodromies of faces in connected simple finite graphs embedded in surfaces whose duals are also simple.
-knotted and -homogeneous triangulations of surfaces
Adam Tyc
A triangulation is called -knotted if it has a single zigzag (up to reversing). A -orientation on a triangulation is a minimal collection of zigzags which double covers the s…
-oriented triangulations of surfaces
Adam Tyc
The main objects of the paper are -oriented triangulations of connected closed -dimensional surfaces. A -orientation of a map is a minimal collection of zigzags which doub…
Triangulations with homogeneous zigzags
Mariusz Kwiatkowski, Mark Pankov, Adam Tyc
We investigate zigzags in triangulations of connected closed -dimensional surfaces and show that there is a one-to-one correspondence between triangulations with homogeneous zig…