{"paper":{"title":"On the Distinguishing Number of Cyclic Tournaments: Towards the Albertson-Collins Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Eric Sopena (LaBRI), Kahina Meslem","submitted_at":"2016-08-17T06:20:15Z","abstract_excerpt":"A distinguishing $r$-labeling of a digraph $G$ is a mapping $\\lambda$ from the set of verticesof $G$ to the set of labels $\\{1,\\dots,r\\}$ such that no nontrivial automorphism of $G$ preserves all the labels.The distinguishing number $D(G)$ of $G$ is then the smallest $r$ for which $G$ admits a distinguishing $r$-labeling.From a result of Gluck (David Gluck, Trivial set-stabilizers in finite permutation groups,{\\em Can. J. Math.} 35(1) (1983), 59--67),it follows that $D(T)=2$ for every cyclic tournament~$T$ of (odd) order $2q+1\\ge 3$.Let $V(T)=\\{0,\\dots,2q\\}$ for every such tournament.Albertson"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04866","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}