Domination in 3-tournaments

DOI10.1016/J.JCTA.2016.09.004zbMATH Open1351.05172arXiv1602.01697OpenAlexW2963736837MaRDI QIDQ346441FDOQ346441

Benny Sudakov, Dániel Korándi

Publication date: 29 November 2016

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

Abstract: A 3-tournament is a complete 3-uniform hypergraph where each edge has a special vertex designated as its tail. A vertex set $X$ dominates $T$ if every vertex not in $X$ is contained in an edge whose tail is in $X$. The domination number of $T$ is the minimum size of such an $X$. Generalizing well-known results about usual (graph) tournaments, Gy'arf'as conjectured that there are 3-tournaments with arbitrarily large domination number, and that this is not the case if any four vertices induce two triples with the same tail. In this short note we solve both problems, proving the first conjecture and refuting the second.

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

zbMATH Keywords

dominationgirthgeneralized tournamentsproperty \(S_k\)

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A note on approximate Nash equilibria
• Large Supports are required for Well-Supported Nash Equilibria
• Difference covers which have small k ‐sums for any k
• Pair dominating graphs

Cited In (4)

• Directed domination in oriented hypergraphs
• The domination number of round digraphs
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Domination in 3-tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346441)