A lower bound on the size of an absorbing set in an arc-coloured tournament

DOI10.1016/J.DISC.2018.09.013zbMath1400.05094arXiv1708.08891OpenAlexW2964236145WikidataQ129126607 ScholiaQ129126607MaRDI QIDQ1618229

Geňa Hahn, Luc P. Devroye, Laurent Beaudou

Publication date: 13 November 2018

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

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

zbMATH Keywords

probabilistic methodarc-coloured tournament

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Domination in transitive colorings of tournaments
• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• A counterexample to a conjecture on edge-coloured tournaments
• Absorbing sets in arc-coloured tournaments

This page was built for publication: A lower bound on the size of an absorbing set in an arc-coloured tournament