Cores of symmetric graprs

Abstract

The core of a graph γ is the smallest graph δ that is homomorphically equivalent to γ (that is, there exist homomorphisms in both directions). The core of γ is unique up to isomorphism and is an induced subgraph of γ. We give a construction in some sense dual to the core. The hull of a graph γ is a graph containing γ as a spanning subgraph, admitting all the endomorphisms of γ, and having as core a complete graph of the same order as the core of γ. This construction is related to the notion of a synchronizing permutation group, which arises in semigroup theory; we provide some more insight by characterizing these permutation groups in terms of graphs. It is known that the core of a vertex-transitive graph is vertex-transitive. In some cases we can make stronger statements: for example, if γ is a non-edge-transitive graph, we show that either the core of γ is complete, or γ is its own core. Rank-three graphs are non-edge-transitive. We examine some families of these to decide which of the two alternatives for the core actually holds. We will see that this question is very difficult, being equivalent in some cases to unsolved questions in finite geometry (for example, about spreads, ovoids and partitions into ovoids in polar spaces). © 2008 Australian Mathematical Society.