9 problems
Let and be prime powers such that and are -groups. Suppose one of the following holds: and are primes with…
Prime-graph complement characterization. For every strictly -solvable group , there exists a set such that
Super-base graph conjecture. For every such and , if is a minimal prime graph, then is not a minimal prime graph for any vertex …
A prime graph is a graph with no nontrivial module, and an infinite prime graph is a prime graph with infinitely many vertices. Let denote the graph associated with a -…
Maslova's conjecture. If the prime graph of does not contain 3-cocliques, then it is isomorphic to the Gruenberg–Kegel graph of some finite solvable group.
Let be an even integer, and let be the largest prime less than . Distinct-prime Goldbach variation. There exist distinct primes and such that … This…
Let and , where and for every prime number . Prime-graph equality conjecture. If , then … i…
Let be a finite group, let denote the set of primes dividing character degrees of , and let be the prime graph of , whose vertices are the elements…
Let be a finite group. Write for the set of primes dividing the order of . The Gruenberg–Kegel graph, or prime graph, of is the graph whose vertices are…