The cyclomatic number of connected graphs without solvable orbits

MaRDI QIDQ2906836zbMATH OpenFDO

Authors Gyula Károlyi, Ambrus Pál

Publication date 5 September 2012

Published in Journal of the Ramanujan Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

circulant graphcyclomatic numbergraph automorphismgraph eigenvalueminimal simple groupprojective algebraic curvesolvable groupsolvable point

Mathematics Subject Classification ID

Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial aspects of representation theory (05E10)

Review text

The authors prove that there exists a connected multigraph \(G\) of cyclotomic number \(c\) without solvable orbits if and only if \(c \notin S = \{ 0, \dots ,5,7,9,12,13,14,17,18,23 \}\). The cyclotomic number of \(G\) is defined to be one minus the Euler characteristic of \(G\) and ``without solvable orbits means that \(\mathrm{Aut}(G)\) acts on each orbit via a non-solvable quotient. Furthermore, if \(g\notin S\) and \(K\) is a field complete relative to a discrete valuation, they show that there exists a smooth, projective, geometrically irreducible curve of genus \(g\) over \(K\) without solvable points over \(K\).

Recommendations

• Solvable graphs of finite groups
• On cubic symmetric non-Cayley graphs with solvable automorphism groups
• On solvable groups and circulant graphs
• Infinitely many nonsolvable groups whose Cayley graphs are Hamiltonian
• Nikolai Ivanovich Lobachevskii (on the bicentenary of his birth)

This page was built for publication: The cyclomatic number of connected graphs without solvable orbits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906836)