Genus, thickness and crossing number of graphs encoding the generating properties of finite groups

DOI10.1016/j.disc.2021.112289zbMath1460.05047arXiv2003.02444OpenAlexW3119011401MaRDI QIDQ2659203

Andrea Lucchini, Cristina Acciarri

Publication date: 25 March 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

thicknesscrossing numbersgenusgenerating graph

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Die Eulersche Funktion endlicher auflösbarer Gruppen
• Probabilistic generation of finite simple groups. II.
• On complemented nonabelian chief factors of a finite group
• Crowns and factorization of the probabilistic zeta function of a finite group.
• Probabilistic generation of finite simple groups
• On topological graphs with at most four crossings per edge
• Finite groups, 2-generation and the uniform domination number
• On the uniform spread of almost simple symplectic and orthogonal groups
• Probabilistic generation of finite groups with a unique minimal normal subgroups
• Handbook of Graph Theory
• Zu einem von B. H. und H. Neumann gestellten Problem
• Hamiltonian cycles in the generating graphs of finite groups
• Finite groups with planar generating graph
• Graphs encoding the generating properties of a finite group
• On the uniform domination number of a finite simple group
• Parameterized Algorithms

This page was built for publication: Genus, thickness and crossing number of graphs encoding the generating properties of finite groups