On prisms, M\"obius ladders and the cycle space of dense graphs

For a graph X, let f_0(X) denote its number of vertices, d(X) its minimum degree and Z_1(X;Z/2) its cycle space in the standard graph-theoretical sense (i.e. 1-dimensional cycle group in the sense of simplicial homology theory with Z/2-coefficients). Call a graph Hamilton-generated if and only if the set of all Hamilton circuits is a Z/2-generating system for Z_1(X;Z/2). The main purpose of this paper is to prove the following: for every s > 0 there exists n_0 such that for every graph X with f_0(X) >= n_0 vertices, (1) if d(X) >= (1/2 + s) f_0(X) and f_0(X) is odd, then X is Hamilton-generated, (2) if d(X) >= (1/2 + s) f_0(X) and f_0(X) is even, then the set of all Hamilton circuits of X generates a codimension-one subspace of Z_1(X;Z/2), and the set of all circuits of X having length either f_0(X)-1 or f_0(X) generates all of Z_1(X;Z/2), (3) if d(X) >= (1/4 + s) f_0(X) and X is square bipartite, then X is Hamilton-generated. All these degree-conditions are essentially best-possible. The implications in (1) and (2) give an asymptotic affirmative answer to a special case of an open conjecture which according to [European J. Combin. 4 (1983), no. 3, p. 246] originates with A. Bondy.Comment: 33 pages; 5 figure

Hamiltonian cycles in Cayley graphs of imprimitive complex reflection groups

Generalizing a result of Conway, Sloane, and Wilkes for real reflection groups, we show the Cayley graph of an imprimitive complex reflection group with respect to standard generating reflections has a Hamiltonian cycle. This is consistent with the long-standing conjecture that for every finite group, G, and every set of generators, S, of G the undirected Cayley graph of G with respect to S has a Hamiltonian cycle.Comment: 15 pages, 4 figures; minor revisions according to referee comments, to appear in Discrete Mathematic

Ternary numbers and algebras. Reflexive numbers and Berger graphs

The Calabi-Yau spaces with SU(m) holonomy can be studied by the algebraic way through the integer lattice where one can construct the Newton reflexive polyhedra or the Berger graphs. Our conjecture is that the Berger graphs can be directly related with the $n$-ary algebras. To find such algebras we study the n-ary generalization of the well-known binary norm division algebras, ${\mathbb R}$, ${\mathbb C}$, ${\mathbb H}$, ${\mathbb O}$, which helped to discover the most important "minimal" binary simple Lie groups, U(1), SU(2) and G(2). As the most important example, we consider the case $n=3$, which gives the ternary generalization of quaternions and octonions, $3^p$, $p=2,3$, respectively. The ternary generalization of quaternions is directly related to the new ternary algebra and group which are related to the natural extensions of the binary $su(3)$ algebra and SU(3) group. Using this ternary algebra we found the solution for the Berger graph: a tetrahedron.Comment: Revised version with minor correction

Recent trends and future directions in vertex-transitive graphs

A graph is said to be vertex-transitive if its automorphism group acts transitively on the vertex set. Some recent developments and possible future directions regarding two famous open problems, asking about existence of Hamilton paths and existence of semiregular automorphisms in vertex-transitive graphs, are discussed, together with some recent results on arc-transitive graphs and half-arc-transitive graphs, two special classes of vertex-transitive graphs that have received particular attention over the last decade