Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed
From MaRDI portal
Publication:2153303
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
Cites work
- scientific article; zbMATH DE number 3747160 (Why is no real title available?)
- scientific article; zbMATH DE number 1256777 (Why is no real title available?)
- scientific article; zbMATH DE number 475365 (Why is no real title available?)
- scientific article; zbMATH DE number 3009780 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- scientific article; zbMATH DE number 822332 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3240401 (Why is no real title available?)
- scientific article; zbMATH DE number 3341276 (Why is no real title available?)
- A bound for the distinguishing index of regular graphs
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
- A note on the asymptotic and computational complexity of graph distinguishability
- A polynomial bound for the orders of primitive solvable groups
- A proof of Pyber's base size conjecture
- Asymmetric trees with two prescribed degrees
- Asymptotic enumeration of Cayley digraphs
- Automorphism groups of algebraic number fields
- Base sizes of primitive groups: bounds with explicit constants
- Bases for primitive permutation groups and a conjecture of Babai
- Breaking graph symmetries by edge colourings
- Diameters of finite simple groups: sharp bounds and applications
- Distinguishing graphs of maximum valence 3
- Distinguishing graphs with infinite motion and nonlinear growth
- Distinguishing graphs with intermediate growth
- Distinguishing infinite graphs
- Distinguishing labellings of group action on vector spaces and graphs
- Distinguishing maps
- Faster canonical forms for primitive coherent configurations (extended abstract)
- Finite Permutation Groups and Finite Simple Groups
- Finite digraphs with given regular automorphism groups
- Graph isomorphism in quasipolynomial time (extended abstract)
- Graphs of Degree Three with a Given Abstract Group
- How comprehensive is the category of semigroups?
- Infinite digraphs with given regular automorphism groups
- Infinite graphs with finite 2-distinguishing cost
- Infinite motion and 2-distinguishability of graphs and groups
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Minimal Degrees of Primitive Permutation Groups, with an Application to Monodromy Groups of Covers of Riemann Surfaces
- Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems
- On 2-closures of rank 3 groups
- On Graphs Whose Full Automorphism Group is an Alternative Group or a Finite Classical Group
- On Subgroups of M 24 . I: Stabilizers of Subsets
- On base sizes for algebraic groups
- On base sizes for symmetric groups
- 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 groups with no regular orbits on the set of subsets
- On minimal degrees and base sizes of primitive permutation groups
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- On the \(n\log{n}\) isomorphism technique (preliminary report)
- On the automorphism groups of strongly regular graphs. II.
- On the groups of automorphisms of Steiner triple and quadruple systems
- On the length of subgroup chains in the symmetric group
- On the number of \(p\)-regular elements in finite simple groups.
- On the order of doubly transitive permutation groups
- On the order of uniprimitive permutation groups
- On the orders of Primitive Permutation Groups
- On the orders of doubly transitive permutation groups, elementary estimates
- On the spectral gap and the automorphism group of distance-regular graphs
- Primitive Groups with no Regular Orbits on the Set of Subsets
- Quasipolynomial-time canonical form for steiner designs
- Small label classes in 2-distinguishing labelings
- Solvable and Nilpotent Subgroups of GL(n,qm)
- Symmetric relations (undirected graphs) with given semigroups
- Symmetry breaking in graphs
- The Minimal Base Size of Primitive Solvable Permutation Groups
- The cost of distinguishing graphs
- The solvable length of a solvable linear group
- Trivial Set-Stabilizers in Finite Permutation Groups
Cited in
(4)
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)