On the maximum cardinality of a consistent set of arcs in a random tournament
From MaRDI portal
Publication:788001
DOI10.1016/0095-8956(83)90060-6zbMath0531.05036OpenAlexW2170151066MaRDI QIDQ788001
Wenceslas Fernandez de la Vega
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(83)90060-6
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20)
Related Items (22)
Proof of an entropy conjecture of Leighton and Moitra ⋮ Probabilistic methods ⋮ The reversing number of a digraph ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ On cutting-plane proofs in combinatorial optimization ⋮ Extremal results on feedback arc sets in digraphs ⋮ Invertibility of Digraphs and Tournaments ⋮ Paths with many shortcuts in tournaments ⋮ Intersections of random hypergraphs and tournaments ⋮ Voting Procedures, Complexity of ⋮ The strongest facets of the acyclic subgraph polytope are unknown ⋮ A fast and effective heuristic for the feedback arc set problem ⋮ Arc‐Disjoint Cycles and Feedback Arc Sets ⋮ Almost given length cycles in digraphs ⋮ Unnamed Item ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Tournament quasirandomness from local counting ⋮ On explicit random-like tournaments ⋮ All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight) ⋮ A constructive solution to a problem of ranking tournaments ⋮ Tournaments and Semicomplete Digraphs ⋮ Voting paradoxes and digraphs realizations
Cites Work
This page was built for publication: On the maximum cardinality of a consistent set of arcs in a random tournament
