On Sets of Consistent Arcs in a Tournament
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3453647
- On the maximum cardinality of a consistent set of arcs in a random tournament
- On arc-traceable tournaments
- On Convex Subsets in Tournaments
- Universal arcs in tournaments
- Extremal results on arc-traceable tournaments
- A note on arc-disjoint cycles in tournaments
- Pancyclic arcs and connectivity in tournaments
- scientific article; zbMATH DE number 3887727
- t-Pancyclic arcs in tournaments
Cited in
(50)- Enchainabilité et seuil de monomorphie des tournois \(n\)-aires. (Chainability and threshold of the monomorphy of \(n\)-ary tournaments)
- Probabilistic methods
- What must be contained in every oriented k-uniform hypergraph
- On claws belonging to every tournament
- Optimally ranking unrankable tournaments
- On -majority voting paradoxes
- On avoidable and unavoidable claws
- A lower bound on the size of an absorbing set in an arc-coloured tournament
- Proof of an entropy conjecture of Leighton and Moitra
- The reversing number of a digraph
- On explicit random-like tournaments
- Paths with many shortcuts in tournaments
- Ranking tournaments with no errors. I: Structural description
- The number of tournaments with the minimum number of upsets
- A constructive solution to a problem of ranking tournaments
- Coloring the edges of a directed graph
- Extension of Arrow's theorem to symmetric sets of tournaments
- Some extremal properties concerning transitivity in graphs
- A refinement of the uncovered set in tournaments
- A survey on the linear ordering problem for weighted or unweighted tournaments
- scientific article; zbMATH DE number 3855148 (Why is no real title available?)
- Cycles in digraphs– a survey
- Coloring the nodes of a directed graph
- scientific article; zbMATH DE number 1286516 (Why is no real title available?)
- Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set
- Weakening arcs in tournaments
- The strongest facets of the acyclic subgraph polytope are unknown
- Intersections of random hypergraphs and tournaments
- scientific article; zbMATH DE number 3453647 (Why is no real title available?)
- Stable sets of weak tournaments
- On Convex Subsets in Tournaments
- A simplified disproof of Beck’s three permutations conjecture and an application to root-mean-squared discrepancy
- The simplicity index of tournaments
- Spectral Slater index of tournaments
- Arc‐Disjoint Cycles and Feedback Arc Sets
- On a conjecture of Quintas and arc-traceability in upset tournaments
- Optimal ranking of tournaments
- Graph theory
- Extremal results on feedback arc sets in digraphs
- Minimal stable sets in tournaments
- Kernels for feedback arc set in tournaments
- Unavoidable structures in infinite tournaments
- Asymptotic lower bounds for the feedback arc set problem in random graphs
- Claws contained in all n-tournaments
- A fast and effective heuristic for the feedback arc set problem
- Dynamic parameterized feedback problems in tournaments
- On the tournament equilibrium set
- On the maximum cardinality of a consistent set of arcs in a random tournament
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
This page was built for publication: On Sets of Consistent Arcs in a Tournament
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5512011)
