A characterization of the prime graphs of solvable groups.

DOI10.1016/J.JALGEBRA.2014.08.040zbMATH Open1331.20029arXiv1305.2368OpenAlexW2963851574MaRDI QIDQ492997FDOQ492997

Authors: Alexander Gruber, Thomas Michael Keller, Mark L. Lewis, Keeley Naughton, Benjamin Strasser 

Publication date: 11 September 2015

Published in: Journal of Algebra (Search for Journal in Brave)

Abstract: Let pi(G) denote the set of prime divisors of the order of a finite group G. The prime graph of G is the graph with vertex set pi(G) with edges {p,q} if and only if there exists an element of order pq in G. In this paper, we prove that a graph is isomorphic to the prime graph of a solvable group if and only if its complement is 3-colorable and triangle free. We then introduce the idea of a minimal prime graph. We prove that there exists an infinite class of solvable groups whose prime graphs are minimal. We prove the 3k-conjecture on prime divisors in element orders for solvable groups with minimal prime graphs, and we show that solvable groups whose prime graphs are minimal have Fitting length 3 or 4.

Full work available at URL: https://arxiv.org/abs/1305.2368

Recommendations

• On the vanishing prime graph of solvable groups.
• p-SOLVABILITY AND A GENERALIZATION OF PRIME GRAPHS OF FINITE GROUPS
• A generalization of prime graphs of finite groups
• scientific article
• On the prime graph of simple groups.
• A characterization of a connected alternating simple group by its prime graph.
• A Characterization of Finite Simple Groups by the Degrees of Vertices of Their Prime Graphs
• The prime graphs of some classes of finite groups
• On characterization by order and prime graph for alternating groups.
• On the vanishing prime graph of finite groups.

zbMATH Keywords

finite groupsprime graphssolvable groupsFrobenius groupstriangle-free graphssets of elements orders3-colorable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Cites Work

• Prime graph components of finite groups
• Character theory of finite groups
• Groups and Rings Having Automorphisms without Non-Trivial Fixed Elements
• An Adjacency Criterion for the Prime Graph of a Finite Simple Group
• On finite groups with disconnected prime graph.
• On connection between the structure of a finite group and the properties of its prime graph.
• Three short proofs in graph theory
• Combinatorial Relations and Chromatic Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finite groups with a five-component prime graph.
• Recognizing Finite Groups Through Order and Degree Pattern
• On finite tetraprimary groups.
• Solvable groups with a small number of prime divisors in the element orders
• A linear bound for \(\rho(n)\)
• The diameter of the prime graph of a finite group

Cited In (26)

• On the vanishing prime graph of solvable groups.
• A generalization of prime graphs of finite groups
• Simple groups whose Gruenberg-Kegel graph or solvable graph is split
• Inverse graphs associated with finite groups
• On finite non-solvable groups whose Gruenberg-Kegel graphs are isomorphic to the paw
• The Gruenberg-Kegel graph of finite solvable rational groups
• The prime graphs of some classes of finite groups
• A classification of the prime graphs of pseudo-solvable groups
• Solvable groups whose prime divisor character degree graphs are 1-connected
• Finite groups whose prime graphs do not contain triangles. I
• Finite almost simple groups whose Gruenberg-Kegel graphs coincide with Gruenberg-Kegel graphs of solvable groups
• The prime graph on class sizes of a finite group has a bipartite complement
• Finite groups with prime graphs of diameter 5
• Solvable graphs and Fermat primes.
• Title not available (Why is that?)
• Finite groups with given properties of their prime graphs
• The prime graphs of groups with arithmetically small composition factors
• The adjacency spectra of some families of minimally connected prime graphs
• On combinatorial properties of Gruenberg-Kegel graphs of finite groups
• OD-Characterization of Certain Finite Groups Having Connected Prime Graphs
• Gruenberg-Kegel graphs: cut groups, rational groups and the prime graph question
• A characterization of the finite simple group \(L_{16}(2)\) by its prime graph.
• A new characterization of simple \(K_5\)-groups of type \(L_3(p)\)
• A combinatorial characterization of finite groups of prime exponent
• On the Hawkes graphs of finite groups
• Criterion of unrecognizability of a finite group by its Gruenberg-Kegel graph

This page was built for publication: A characterization of the prime graphs of solvable groups.

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