Domination in transitive colorings of tournaments

DOI10.1016/J.JCTB.2014.02.001zbMath1298.05132arXiv1302.4677OpenAlexW2072025981MaRDI QIDQ403357

Dömötör Pálvölgyi, András Gyárfás

Publication date: 29 August 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

dominationtransitive tournaments

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Infinite quasi-transitive digraphs with domination number 2 ⋮ A lower bound on the size of an absorbing set in an arc-coloured tournament ⋮ Domination and fractional domination in digraphs ⋮ TRAVERSING A GRAPH IN GENERAL POSITION ⋮ Domination in tournaments ⋮ Domination in Digraphs ⋮ A proof of the Erdös-Sands-Sauer-Woodrow conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• Monochromatic sinks in nearly transitive arc-colored tournaments
• Covering with Euclidean boxes
• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• Almost tight bounds for \(\epsilon\)-nets
• Dominating sets in \(k\)-majority tournaments.
• Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments
• Transitive Orientation of Graphs and Identification of Permutation Graphs

This page was built for publication: Domination in transitive colorings of tournaments