277 citations · 305 across the 7 of their papers we have counts for
9 papers
Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's Conjecture confirmed
Laszlo Babai
An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of…
List-decoding homomorphism codes with arbitrary codomains
László Babai, Timothy J. F. Black, Angela Wuu
The codewords of the homomorphism code are the affine homomorphisms between two finite groups, and , generalizing Hadamard codes. Following the wo…
Graph Isomorphism in Quasipolynomial Time
László Babai
We show that the Graph Isomorphism (GI) problem and the related problems of String Isomorphism (under group action) (SI) and Coset Intersection (CI) can be solved in quasipolynomia…
Asymptotic Delsarte cliques in distance-regular graphs
László Babai, John Wilmes
We give a new bound on the parameter (number of common neighbors of a pair of adjacent vertices) in a distance-regular graph , improving and generalizing bounds for strongly…
Most primitive groups are full automorphism groups of edge-transitive hypergraphs
Laszlo Babai, Peter J. Cameron
We prove that, for a primitive permutation group G acting on a set of size n, other than the alternating group, the probability that Aut(X,Y^G) = G for a random subset Y of X, tend…
Element order versus minimal degree in permutation groups: an old lemma with new applications
László Babai, Ákos Seress
In this note we present a simplified and slightly generalized version of a lemma the authors published in 1987. The lemma as stated here asserts that if the order of a permutation…