On Sets of Consistent Arcs in a Tournament

DOI10.4153/CMB-1965-017-1zbMath0137.43301OpenAlexW2033484635WikidataQ105530392 ScholiaQ105530392MaRDI QIDQ5512011

Paul Erdős, John W. Moon

Publication date: 1965

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cmb-1965-017-1

zbMATH Keywords

topology

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items

Proof of an entropy conjecture of Leighton and Moitra, Probabilistic methods, What must be contained in every oriented k-uniform hypergraph, The reversing number of a digraph, A survey on the linear ordering problem for weighted or unweighted tournaments, Coloring the nodes of a directed graph, Optimal ranking of tournaments, Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique, Extremal results on feedback arc sets in digraphs, Paths with many shortcuts in tournaments, Intersections of random hypergraphs and tournaments, Kernels for feedback arc set in tournaments, The simplicity index of tournaments, On claws belonging to every tournament, The strongest facets of the acyclic subgraph polytope are unknown, Claws contained in all \(n\)-tournaments, A fast and effective heuristic for the feedback arc set problem, Arc‐Disjoint Cycles and Feedback Arc Sets, Unnamed Item, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Optimally ranking unrankable tournaments, Graph theory, Ranking tournaments with no errors. I: Structural description, On explicit random-like tournaments, Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set, The number of tournaments with the minimum number of upsets, Cycles in digraphs– a survey, A simplified disproof of Beck’s three permutations conjecture and an application to root-mean-squared discrepancy, Some extremal properties concerning transitivity in graphs, A constructive solution to a problem of ranking tournaments, On \(\lambda\)-majority voting paradoxes, On avoidable and unavoidable claws, On the maximum cardinality of a consistent set of arcs in a random tournament, Coloring the edges of a directed graph