Pages that link to "Item:Q788001"
From MaRDI portal
The following pages link to On the maximum cardinality of a consistent set of arcs in a random tournament (Q788001):
Displaying 18 items.
- Intersections of random hypergraphs and tournaments (Q472404) (← links)
- A fast and effective heuristic for the feedback arc set problem (Q688447) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Probabilistic methods (Q1091406) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Proof of an entropy conjecture of Leighton and Moitra (Q1621423) (← links)
- Voting paradoxes and digraphs realizations (Q1865256) (← links)
- The reversing number of a digraph (Q1894351) (← links)
- Tournament quasirandomness from local counting (Q2036620) (← links)
- On explicit random-like tournaments (Q2042219) (← links)
- Paths with many shortcuts in tournaments (Q2219961) (← links)
- A constructive solution to a problem of ranking tournaments (Q2329199) (← links)
- Almost given length cycles in digraphs (Q2482351) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Arc‐Disjoint Cycles and Feedback Arc Sets (Q5417829) (← links)
- Extremal results on feedback arc sets in digraphs (Q6119220) (← links)
- Invertibility of Digraphs and Tournaments (Q6141864) (← links)
