Checked 20 November 2026.
- Sonntag and Teichert, Domination hypergraphs of certain digraphs, Opuscula Math. 30 (2010), 179–191 is the source of the result's statement. Page 182 presents it as a conjecture. The authors report exhaustive checks through order nine, sampled tournaments up to order 23, and prove that every nontrivial component has at least three edges.
- The 2010 workshop problem list, Conjecture 26.1 and the 11th C5 workshop problem list, Conjecture 29.1 say “always connected.” The paper gives the precise convention allowing isolated vertices. In particular, a transitive tournament on at least two vertices has just one singleton edge and isolated vertices.
- The 2004 Freiberg preprint is catalogued under a related title. An accessible full text was not located. The journal paper also cites Wartner's 2006 thesis for the order-nine check, and continues to state the general case as a conjecture.
- OpenAlex and Semantic Scholar listed no forward citations of the journal article. Searches by both titles, DOI, exact conjecture wording, author names, and German terms for domination hypergraphs and tournaments turned up the source, workshop restatements, and related work. Searches pairing oriented-graph domination hypergraphs with “disconnected” and “two stars” did not find the classification in the proof.
- The tournament domination graph literature treats the graph on dominating pairs. The hypergraph here uses all inclusion-minimal dominating sets. Work on domination in transitively edge-coloured tournaments uses the closed in-neighbourhood formulation for a different domination question. Recent hypergraph completion work concerns undirected graphs.
No prior general proof or counterexample was located for the precise journal formulation. This check is limited to located sources.