On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture

DOI10.1016/j.dam.2018.10.021zbMath1464.05164arXiv1608.04866OpenAlexW2963335568WikidataQ123337000 ScholiaQ123337000MaRDI QIDQ2026341

Kahina Meslem, Eric Sopena

Publication date: 19 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

automorphism groupdistinguishing numbercyclic tournamentAlbertson-Collins conjecture

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Distinguishing orthogonality graphs ⋮ Distinguishing numbers and distinguishing indices of oriented graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Finite factors of Bernoulli schemes and distinguishing labelings of directed graphs
• Distinguishing Cartesian products of countable graphs
• Distinguishing number and adjacency properties
• Bounding the distinguishing number of infinite graphs and permutation groups
• On computing the distinguishing numbers of trees and forests
• Cartesian powers of graphs can be distinguished by two labels
• Destroying automorphisms by fixing nodes
• Identifying graph automorphisms using determining sets
• Using determining sets to distinguish Kneser graphs
• Distinguishability of locally finite trees
• On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
• Another proof of Gluck's theorem
• The distinguishing number of the hypercube
• Symmetry breaking in graphs
• Symmetry breaking in tournaments
• The cost of 2-distinguishing Cartesian powers
• Distinguishing infinite graphs
• Distinguishing number of countable homogeneous relational structures
• The distinguishing number of Cartesian products of complete graphs
• Distinguishing colorings of Cartesian products of complete graphs
• On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
• Trivial Set-Stabilizers in Finite Permutation Groups
• Distinguishing Cartesian powers of graphs
• Distinguishing Cartesian powers of graphs

This page was built for publication: On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture