Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed

DOI10.1016/J.JALGEBRA.2021.10.033OpenAlexW3212559078WikidataQ123207189 ScholiaQ123207189MaRDI QIDQ2153303FDOQ2153303

Authors: László Babai 

Publication date: 4 July 2022

Published in: Journal of Algebra (Search for Journal in Brave)

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

Recommendations

• Asymmetric colouring of locally compact permutation groups
• Distinguishing graphs with infinite motion and nonlinear growth
• Local finiteness, distinguishing numbers, and Tucker's conjecture
• Distinguishing infinite graphs with bounded degrees
• Infinite motion and 2-distinguishability of graphs and groups

zbMATH Keywords

asymmetrygraphsprofinite groupsminimal degreepermutation groupslocally finite graphssetwise stabilizers

Mathematics Subject Classification ID

Associative rings and algebras (16-XX) Group theory and generalizations (20-XX)

Cites Work

• Title not available (Why is that?)
• On groups with no regular orbits on the set of subsets
• Symmetry breaking in graphs
• Title not available (Why is that?)
• Primitive Groups with no Regular Orbits on the Set of Subsets
• Title not available (Why is that?)
• The Minimal Base Size of Primitive Solvable Permutation Groups
• Title not available (Why is that?)
• On the number of \(p\)-regular elements in finite simple groups.
• Finite Permutation Groups and Finite Simple Groups
• Title not available (Why is that?)
• Minimal Degrees of Primitive Permutation Groups, with an Application to Monodromy Groups of Covers of Riemann Surfaces
• On the order of uniprimitive permutation groups
• On base sizes for symmetric groups
• Faster Canonical Forms for Primitive Coherent Configurations
• On the Complexity of Canonical Labeling of Strongly Regular Graphs
• Title not available (Why is that?)
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• On base sizes for algebraic groups
• A polynomial bound for the orders of primitive solvable groups
• Solvable and Nilpotent Subgroups of GL(n,q^m)
• Symmetric relations (undirected graphs) with given semigroups
• Graphs of Degree Three with a Given Abstract Group
• On minimal degrees and base sizes of primitive permutation groups
• Diameters of finite simple groups: sharp bounds and applications
• On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
• On the groups of automorphisms of Steiner triple and quadruple systems
• How comprehensive is the category of semigroups?
• Trivial Set-Stabilizers in Finite Permutation Groups
• Finite digraphs with given regular automorphism groups
• Distinguishing maps
• A note on the asymptotic and computational complexity of graph distinguishability
• Distinguishing infinite graphs
• Distinguishing labellings of group action on vector spaces and graphs
• Distinguishing graphs with infinite motion and nonlinear growth
• Title not available (Why is that?)
• On the orders of Primitive Permutation Groups
• On the order of doubly transitive permutation groups
• On the orders of doubly transitive permutation groups, elementary estimates
• On the length of subgroup chains in the symmetric group
• On the automorphism groups of strongly regular graphs. II.
• On the \(n\log{n}\) isomorphism technique (preliminary report)
• Quasipolynomial-time canonical form for steiner designs
• Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems
• Infinite graphs with finite 2-distinguishing cost
• Small label classes in 2-distinguishing labelings
• Title not available (Why is that?)
• The Cost of Distinguishing Graphs
• Automorphism groups of algebraic number fields
• Graph isomorphism in quasipolynomial time [extended abstract]
• Title not available (Why is that?)
• The solvable length of a solvable linear group
• On Graphs Whose Full Automorphism Group is an Alternative Group or a Finite Classical Group
• Bases for primitive permutation groups and a conjecture of Babai
• Title not available (Why is that?)
• Breaking graph symmetries by edge colourings
• Asymmetric trees with two prescribed degrees
• Infinite digraphs with given regular automorphism groups
• Base sizes of primitive groups: bounds with explicit constants
• Infinite motion and 2-distinguishability of graphs and groups
• Distinguishing graphs with intermediate growth
• On Subgroups of M 24 . I: Stabilizers of Subsets
• A proof of Pyber's base size conjecture
• Asymptotic enumeration of Cayley digraphs
• A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
• On the spectral gap and the automorphism group of distance-regular graphs
• Distinguishing graphs of maximum valence 3
• A bound for the distinguishing index of regular graphs
• On 2-closures of rank 3 groups

Cited In (3)

• Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's Conjecture confirmed
• Asymmetric colouring of locally compact permutation groups
• Distinguishing infinite graphs with bounded degrees

This page was built for publication: Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2153303)