Biembeddings of cycle systems using integer Heffter arrays
From MaRDI portal
Abstract: In this paper we will show the existence of a face -colourable biembedding of the complete graph onto an orientable surface where each face is a cycle of a fixed length , for infinitely many values of . In particular, under certain conditions, we show that there exists at least non-isomorphic face -colourable biembeddings of in which all faces are cycles of length . These conditions are: , and either is prime or and implies . To achieve this result we begin by verifying the existence of non-equivalent Heffter arrays, , which satisfy the conditions: (1) for each row and each column the sequential partial sums determined by the natural ordering must be distinct modulo ; (2) the composition of the natural orderings of the rows and columns is equivalent to a single cycle permutation on the entries in the array. The existence of Heffter arrays that satisfy condition (1) was established earlier in cite{BCDY} and in this current paper we vary this construction and show that there are at least such non-equivalent that satisfy condition (1) and then show that each of these Heffter arrays also satisfy condition (2) under certain conditions.
Recommendations
- Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
- Heffter arrays and biembedding graphs on surfaces
- Biembedding Steiner triple systems and n-cycle systems on orientable surfaces
- Relative Heffter arrays and biembeddings
- Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
Cited in
(5)- Existence of \(\lambda\)-fold non-zero sum Heffter arrays through local considerations
- A class of highly symmetric Archdeacon embeddings
- A survey of Heffter arrays
- On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs
- Biembeddings of Archdeacon type: their full automorphism group and their number
This page was built for publication: Biembeddings of cycle systems using integer Heffter arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6321028)