Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed
From MaRDI portal
Publication:2153303
DOI10.1016/J.JALGEBRA.2021.10.033OpenAlexW3212559078WikidataQ123207189 ScholiaQ123207189MaRDI QIDQ2153303
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
asymmetrypermutation groupsgraphsminimal degreeprofinite groupslocally finite graphssetwise stabilizers
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the automorphism groups of strongly regular graphs. II.
- Infinite graphs with finite 2-distinguishing cost
- Distinguishing maps
- On minimal degrees and base sizes of primitive permutation groups
- On groups with no regular orbits on the set of subsets
- Finite digraphs with given regular automorphism groups
- On the order of doubly transitive permutation groups
- On the order of uniprimitive permutation groups
- A polynomial bound for the orders of primitive solvable groups
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- 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
- Automorphism groups of algebraic number fields
- Infinite digraphs with given regular automorphism groups
- On the groups of automorphisms of Steiner triple and quadruple systems
- Bases for primitive permutation groups and a conjecture of Babai
- A note on the asymptotic and computational complexity of graph distinguishability
- A proof of Pyber's base size conjecture
- Base sizes of primitive groups: bounds with explicit constants
- On the orders of doubly transitive permutation groups, elementary estimates
- Symmetry breaking in graphs
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
- On base sizes for algebraic groups
- On the spectral gap and the automorphism group of distance-regular graphs
- Asymptotic enumeration of Cayley digraphs
- A bound for the distinguishing index of regular graphs
- Infinite motion and 2-distinguishability of graphs and groups
- Distinguishing graphs of maximum valence 3
- Distinguishing infinite graphs
- Distinguishing graphs with intermediate growth
- Breaking graph symmetries by edge colourings
- Distinguishing labellings of group action on vector spaces and graphs
- Symmetric relations (undirected graphs) with given semigroups
- The solvable length of a solvable linear group
- How comprehensive is the category of semigroups?
- Faster Canonical Forms for Primitive Coherent Configurations
- On the Number ofp-Regular Elements in Finite Simple Groups
- On base sizes for symmetric groups
- Distinguishing graphs with infinite motion and nonlinear growth
- Minimal Degrees of Primitive Permutation Groups, with an Application to Monodromy Groups of Covers of Riemann Surfaces
- On Graphs Whose Full Automorphism Group is an Alternative Group or a Finite Classical Group
- On the length of subgroup chains in the symmetric group
- On the orders of Primitive Permutation Groups
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- Finite Permutation Groups and Finite Simple Groups
- Solvable and Nilpotent Subgroups of GL(n,qm)
- Asymmetric trees with two prescribed degrees
- Primitive Groups with no Regular Orbits on the Set of Subsets
- Trivial Set-Stabilizers in Finite Permutation Groups
- The Minimal Base Size of Primitive Solvable Permutation Groups
- On 2-closures of rank 3 groups
- Graph isomorphism in quasipolynomial time [extended abstract]
- The Cost of Distinguishing Graphs
- On the nlog n isomorphism technique (A Preliminary Report)
- Quasipolynomial-time canonical form for steiner designs
- Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems
- Small label classes in 2-distinguishing labelings
- On Subgroups of M 24 . I: Stabilizers of Subsets
- Graphs of Degree Three with a Given Abstract Group
- Diameters of finite simple groups: sharp bounds and applications
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)