Largest digraphs contained in all n-tournaments
From MaRDI portal
Publication:788740
DOI10.1007/BF02579345zbMath0532.05032MaRDI QIDQ788740
Vera T. Sós, Michael E. Saks, Nathan Linial
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579345
Related Items
Orientation Ramsey Thresholds for Cycles and Cliques, An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs, Ramsey numbers for tournaments, Claws contained in all \(n\)-tournaments, What must be contained in every oriented k-uniform hypergraph, On claws belonging to every tournament, 2-partition-transitive tournaments, Learnability and rationality of choice., On avoidable and unavoidable claws, \(k\)-ary spanning trees contained in tournaments, Tournaments and Semicomplete Digraphs
Cites Work