Locally finite homogeneous graphs

A connected graph G is said to be z-homogeneous if any isomorphism between finite connected induced subgraphs of G extends to an automorphism of G. Finite z-homogeneous graphs were classified in [17]. We show that z-homogeneity is equivalent to finite-transitivity on the class of infinite locally finite graphs. Moreover, we classify the graphs satisfying these properties. Our study of bipartite z-homogeneous graphs leads to a new characterization for hypercubes.     

Quantum automorphism groups of homogeneous graphs

Associated to a finite graph X is its quantum automorphism group G. The main problem is to compute the Poincaré series of G, meaning the series f(z)=1+c₁z+c₂z²+? whose coefficients are multiplicities of 1 into tensor powers of the fundamental representation. In this paper we find a duality between certain quantum groups and planar algebras, which leads to a planar algebra formulation of the problem. Together with some other results, this gives f for all homogeneous graphs having 8 vertices or less.     

Locally primitive Cayley graphs of finite simple groups

A graph Г is said to be G-locally primitive, where G is a subgroup of automorphisms of Г, if the stabiliser G_a of a vertex α acts primitively on the set Г( α ) of vertices of Г adjacent to α. For a finite non-abelian simple group L and a Cayley subset S of L, suppose that L ⊴ G ⩽ Aut( L), and the Cayley graph Г = Cay ( L, S) is G-locally primitive. In this paper we prove that L is a simple group of Lie type, and either the valency of Г is an add prine divisor of |Out(L)|, orL =PΩ ₈ ⁺ (q) and Г has valency 4. In either cases, it is proved that the full automorphism group of Г is also almost simple with the same socle L.     

Locally petersen graphs

A graph Γ is locally Petersen if, for each point t of Γ, the graph induced by Γ on all points adjacent to t is isomorphic to the Petersen graph. We prove that there are exactly three isomorphism classes of connected, locally Petersen graphs and further characterize these graphs by certain of their parameters.     

Combinatorially homogeneous graphs

Gardiner classified ultrahomogeneous graphs and posed the problem of defining “combinatorial homogeneity”. Later, Ronse proved that homogeneous graphs are ultrahomogeneous by classifying such graphs. In this paper, we give a direct proof that (suitably defined) combinatorially homogeneous graphs are ultrahomogeneous. Also, we clasify combinatorially C-homogeneous graphs.     

Locally regular coloured graphs

In this work we introduce the concept of locally regular coloured graph as a generalization to any dimension of the concept of regularity for maps on surfaces of W. Threlfall. We prove that locally regular coloured graphs can be obtained from the classical spherical, euclidean and hyperbollic tessellations. Finally we describe locally regular coloured graphs on spherical 3-manifolds.Partially supported by British-Spanish Join Research Program and DGICYT.     

Locally conformally homogeneous pseudo-Riemannian spaces

Locally homogeneous Riemannian spaces were studied in [1–4]. Locally conformally homogeneous Riemannian spaces were considered in [10]. Moreover, the theorem claiming that every such space is either conformally flat or conformally equivalent to a locally homogeneous Riemannian space was proved.In this article, we study locally conformally homogeneous pseudo-Riemannian spaces and prove a theorem on their structure. Using three-dimensional Lie groups and the six-dimensional Heisenberg group [11], we construct some examples showing the difference between the Riemannian and pseudo-Riemannian cases for such spaces.     

Countable homogeneous multipartite graphs

We give a classification of all the countable homogeneous multipartite graphs. This generalizes the similar result for bipartite graphs given in Goldstern et al. (1996) [6].     

Locally elusive classical groups

We apply a new notion of angle between projections to deduce criteria for uniform convergence results of the alternating projections method under several different settings: averaged projections, cyclic products, quasiperiodic products and random products.