All vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism

Giudici, Michael; Xu, Jing

doi:10.1007/s10801-006-0032-5

Cited by 31 publications

(36 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such semiregular permutations give useful structural information about the graph, as well as assisting with graph construction and enumeration (see for example [13,Section 4]) and graph drawing (see for example [10]). The conjecture was proved for cubic graphs [16] in 1998 and locally-quasiprimitive graphs [9] in 2007 (and hence, in particular, for all arc-transitive graphs of prime valency). In fact for vertex-transitive cubic graphs it is known that the maximum size of a semiregular subgroup (containing only semiregular automorphisms) is unbounded as the number of vertices increases [4,12].…”

Section: Semiregular Permutations In Graph Theorymentioning

confidence: 99%

On semiregular permutations of a finite set

et al. 2012

View full text Add to dashboard Cite

Abstract. In this paper we establish upper and lower bounds for the proportion of permutations in symmetric groups which power up to semiregular permutations (permutations all of whose cycles have the same length). Provided that an integer n has a divisor at most d, we show that the proportion of such elements in S n is at least cn −1+1/2d for some constant c depending only on d whereas the proportion of semiregular elements in S n is less than 2n −1 .

show abstract

Section: Semiregular Permutations In Graph Theorymentioning

confidence: 99%

On semiregular permutations of a finite set

et al. 2012

View full text Add to dashboard Cite

show abstract

“…(A permutation group is quasiprimitive if every non-trivial normal subgroup is transitive.) Very recently, Giudici and Xu [51] extended these results by combining valency and type of action approaches to classify all biquasiprimitive groups without semiregular elements, and to prove the existence of semiregular automorphisms in vertex-transitive graphs whose vertex stabilizers act quasiprimitively on the corresponding sets of neighbors. (A biquasiprimitive permutation group is a transitive permutation group for which every nontrivial normal subgroup has at most two orbits and there is some normal subgroup with precisely two orbits.)…”

Section: Semiregularitymentioning

confidence: 99%

Recent trends and future directions in vertex-transitive graphs

Kutnar

Marušič

2008

Ars Math. Contemp.

View full text Add to dashboard Cite

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.Keywords: Vertex-transitive graph, arc-transitive graph, half-arc-transitive graph, Hamilton cycle, Hamilton path, semiregular group, (im)primitive group.Math. Subj. Class.: 05C25, 20B25 1 In the beginning Vertex-transitive graphs, that is, graphs whose automorphisms groups acts transitively on the corresponding vertex sets, have been an active topic of research for a long time now. Much of this interest is due to their suitability to model scientific phenomena when symmetry is an issue. It is the aim of this article to discuss recent developments surrounding two well known open problems in vertex-transitive graphs -the Hamilton path/cycle problem and the semiregularity problem -as well as the general question addressing structural properties of arc-transitive and half-arc-transitive graphs. In doing so we will also try to contemplate possible directions this area of research is likely to take in the near future. * Supported by "Agencija za raziskovalno dejavnost Republike Slovenije", research program P1-0285.E-mail addresses: klavdija.kutnar@upr.si (Klavdija Kutnar), dragan.marusic@upr.si (Dragan Marušič) Copyright c 2008 DMFA -založništvo K. Kutnar, D. Marušič: Recent Trends and Future Directions in Vertex-Transitive Graphs 113The article is organized as follows. In Section 2 we discuss the problem, posed by the second author in 1981 (see [79]) who asked if it is true that a vertex-transitive digraph contains a nonidentity automorphism with all orbits of equal length, in short, a semiregular automorphism. Section 3 gives a quick overview of the problem, posed by Lovàsz in 1969 (see [72]), who asked if it is true that every connected vertex-transitive graph contains a Hamilton path, thus motivating a great deal of research into vertex-transitive graphs in the following decades. In Section 4, imprimitivity, one of the most fundamental concepts in the theory of permutation groups, is considered with special emphasis given to a recently developed theory which links the existence of blocks of imprimitivity in vertex-transitive graphs, having an abelian semiregular subgroup of automorphisms, to certain conditions that need to be satisfied in the corresponding quotient graph relative to the orbits of such a subgroup. Finally, in Section 5 we deal with some recent structural results on arc-transitive and half-arc-transitive graphs, as well as their link to some open problems in the theory of configurations.For group-theoretic terms not defined here we refer the reader to [124]. Semiregularit...

show abstract

“…We remark that the proofs of the first two results hold for all transitive groups, while the proofs of the remaining results also hold for transitive 2-closed groups. It is also known that a semiregular automorphism exists in a vertex-transitive graph whose vertex stabilizers acts quasiprimitively on the corresponding sets of neighbors, and consequently in a symmetric graph whose valency is prime [14]. Finally, semiregular automorphisms are known to exist in a symmetric graph whose valency is a product of two primes and such that its automorphism group has a nonabelian normal subgroup with at least three orbits on the vertex set [24].…”

Section: Introductory and Historic Remarksmentioning

confidence: 99%