Babai's problem: Difference between revisions
Jump to navigation
Jump to search
imported>Citation bot Altered issue. | Use this bot. Report bugs. | Suggested by Abductive | Category:Unsolved problems in graph theory | #UCB_Category 5/32 |
(No difference)
|
Latest revision as of 08:39, 8 May 2024
Template:Unsolved Babai's problem is a problem in algebraic graph theory first proposed in 1979 by László Babai.[1]
Babai's problem
Let be a finite group, let be the set of all irreducible characters of , let be the Cayley graph (or directed Cayley graph) corresponding to a generating subset of , and let be a positive integer. Is the set
an invariant of the graph ? In other words, does imply that ?
BI-group
A finite group is called a BI-group (Babai Invariant group)[2] if for some inverse closed subsets and of implies that for all positive integers .
Open problem
Which finite groups are BI-groups?[3]