Open Access
Subscription Access
Open Access
Subscription Access
The Cyclomatic Number of Connected Graphs without Solvable Orbits
Subscribe/Renew Journal
We study the combinatorics of constructing non-singular geometrically irreducible projective curves that do not admit rational points over finite solvable extensions of the base field. A graph is without solvable orbits if its group of automorphisms acts on each of its orbits through a non-solvable quotient. We prove that there is a connected graph without solvable orbits of cyclomatic number c if and only if c is equal to 6, 8, 10, 11, 15, 16, 19, 20, 21, 22, or is at least 24. For these numbers there exist smooth geometrically irreducible projective curves without solvable points whose genus equals c.
User
Subscription
Login to verify subscription
Font Size
Information
Abstract Views: 191
PDF Views: 0