Forbidden subgraphs in generating graphs of finite groups

DOI10.5802/alco.229OpenAlexW3154239517MaRDI QIDQ2097194

Daniele Nemmi, Andrea Lucchini

Publication date: 11 November 2022

Published in: Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

perfect graphscographsgenerating graph

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• The generating graph of finite soluble groups.
• Die Eulersche Funktion endlicher auflösbarer Gruppen
• The strong perfect graph theorem
• Probabilistic generation of finite simple groups. II.
• Perfect product graphs
• Probabilistic generation of finite simple groups
• Connectivity of generating graphs of nilpotent groups
• The diameter of the generating graph of a finite soluble group
• The spread of a finite group
• The Maximal Subgroups of the Low-Dimensional Finite Classical Groups
• Intersection graphs of subgroups of finite groups
• Zu einem von B. H. und H. Neumann gestellten Problem
• Hamiltonian cycles in the generating graphs of finite groups
• The M\"obius function of the small Ree groups
• Graphs defined on groups
• PRIMITIVE PERMUTATION GROUPS CONTAINING A CYCLE

This page was built for publication: Forbidden subgraphs in generating graphs of finite groups