English

Uniquely D-colourable digraphs with large girth

Combinatorics 2019-08-15 v1

Abstract

Let C and D be digraphs. A mapping f:V(D)V(C)f:V(D)\to V(C) is a C-colouring if for every arc uvuv of D, either f(u)f(v)f(u)f(v) is an arc of C or f(u)=f(v)f(u)=f(v), and the preimage of every vertex of C induces an acyclic subdigraph in D. We say that D is C-colourable if it admits a C-colouring and that D is uniquely C-colourable if it is surjectively C-colourable and any two C-colourings of D differ by an automorphism of C. We prove that if a digraph D is not C-colourable, then there exist digraphs of arbitrarily large girth that are D-colourable but not C-colourable. Moreover, for every digraph D that is uniquely D-colourable, there exists a uniquely D-colourable digraph of arbitrarily large girth. In particular, this implies that for every rational number r1r\geq 1, there are uniquely circularly r-colourable digraphs with arbitrarily large girth.

Keywords

Cite

@article{arxiv.1109.5208,
  title  = {Uniquely D-colourable digraphs with large girth},
  author = {Ararat Harutyunyan and P. Mark Kayll and Bojan Mohar and Liam Rafferty},
  journal= {arXiv preprint arXiv:1109.5208},
  year   = {2019}
}

Comments

21 pages, 0 figures To be published in Canadian Journal of Mathematics

R2 v1 2026-06-21T19:09:36.793Z