On maximal transitive subtournaments
From MaRDI portal
Publication:5642582
DOI10.1017/S0013091500009639zbMath0234.05108MaRDI QIDQ5642582
Publication date: 1971
Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)
05C20: Directed graphs (digraphs), tournaments
Related Items
Improved bounds for minimal feedback vertex sets in tournaments, Feedback Vertex Sets in Tournaments, Bounding the feedback vertex number of digraphs in terms of vertex degrees, Upper bounds on the size of transitive subtournaments in digraphs, New bounds on the Ramsey number \(r ( I_m , L_n )\), Fixed-parameter tractability results for feedback set problems in tournaments, Open problems around exact algorithms, Tournaments and Semicomplete Digraphs