Let X,Y be finite sets, r,s,h,??N with s?r,X?Y. By ?Xh we mean the collection of all h-subsets X where each subset occurs ? times. A coloring (partition) is r-regular if element in exactly r subsets color. one-regular color class a perfect matching. We are interested necessary and sufficient conditions under which an can embedded into s-regular ?Yh. Using algebraic techniques involving glueing ...

A regular surface is a closed genus g surface defined as the tubular neighbourhood of the edge graph of a regular map. A regular map is a family of disc type polygons glued together to form a 2-manifold which is flag transitive. The visualization of this highly symmetric surface is an intriguing and challenging problem. Unlike regular maps, regular surfaces can always be visualized as 3D embedd...

Katerinis, P., Regular factors in regular graphs, Discrete Mathematics 113 (1993) 269-274. Let G be a k-regular, (k I)-edge-connected graph with an even number of vertices, and let m be an integer such that 1~ m s k 1. Then the graph obtained by removing any k m edges of G, has an m-factor. All graphs considered are finite. We shall allow graphs to contain multiple edges and we refer the reader...

Regular homomorphisms of oriented maps essentially arise from a factorization by a subgroup of automorphisms. This kind of map homomorphism is studied in detail, and generalized to the case when the induced homomorphism of the underlying graphs is not valency preserving. Reconstruction is treated by means of voltage assignments on angles, a natural extension of the common assignments on darts. ...

‎in this paper‎, ‎the type-{rm ii} matrices on (negative) latin square graphs are considered and it is proved that‎, ‎under‎ ‎certain conditions‎, ‎the nomura algebras of such type-{rm ii} matrices are trivial‎. ‎in addition‎, ‎we construct type-{rm ii} matrices‎ ‎on doubly regular tournaments and show that the nomura algebras of such matrices are also trivial‎.