Pages that link to "Item:Q5512011"

The following pages link to On Sets of Consistent Arcs in a Tournament (Q5512011):

Displaying 47 items.

• Coloring the nodes of a directed graph (Q399510) (← links)
• Intersections of random hypergraphs and tournaments (Q472404) (← links)
• Minimal stable sets in tournaments (Q634517) (← links)
• Kernels for feedback arc set in tournaments (Q657916) (← links)
• Claws contained in all \(n\)-tournaments (Q688260) (← links)
• A fast and effective heuristic for the feedback arc set problem (Q688447) (← links)
• On the tournament equilibrium set (Q750267) (← links)
• On the maximum cardinality of a consistent set of arcs in a random tournament (Q788001) (← links)
• Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
• An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
• Enchainabilité et seuil de monomorphie des tournois \(n\)-aires. (Chainability and threshold of the monomorphy of \(n\)-ary tournaments) (Q1087544) (← links)
• Probabilistic methods (Q1091406) (← links)
• What must be contained in every oriented k-uniform hypergraph (Q1092925) (← links)
• On claws belonging to every tournament (Q1180417) (← links)
• Optimally ranking unrankable tournaments (Q1234694) (← links)
• On \(\lambda\)-majority voting paradoxes (Q1296508) (← links)
• On avoidable and unavoidable claws (Q1584226) (← links)
• A lower bound on the size of an absorbing set in an arc-coloured tournament (Q1618229) (← links)
• Proof of an entropy conjecture of Leighton and Moitra (Q1621423) (← links)
• The reversing number of a digraph (Q1894351) (← links)
• On explicit random-like tournaments (Q2042219) (← links)
• Paths with many shortcuts in tournaments (Q2219961) (← links)
• Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
• The number of tournaments with the minimum number of upsets (Q2303437) (← links)
• A constructive solution to a problem of ranking tournaments (Q2329199) (← links)
• Coloring the edges of a directed graph (Q2353348) (← links)
• Extension of Arrow's theorem to symmetric sets of tournaments (Q2370447) (← links)
• Some extremal properties concerning transitivity in graphs (Q2561235) (← links)
• A refinement of the uncovered set in tournaments (Q2633439) (← links)
• A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
• Cycles in digraphs– a survey (Q3907591) (← links)
• Star-factors of tournaments (Q4242965) (← links)
• Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set (Q4446885) (← links)
• Weakening arcs in tournaments (Q4458597) (← links)
• The strongest facets of the acyclic subgraph polytope are unknown (Q4645939) (← links)
• (Q4777323) (← links)
• Stable sets of weak tournaments (Q4831869) (← links)
• On Convex Subsets in Tournaments (Q4875436) (← links)
• A simplified disproof of Beck’s three permutations conjecture and an application to root-mean-squared discrepancy (Q4993131) (← links)
• The simplicity index of tournaments (Q5061406) (← links)
• (Q5071138) (← links)
• Arc‐Disjoint Cycles and Feedback Arc Sets (Q5417829) (← links)
• On a conjecture of Quintas and arc-traceability in upset tournaments (Q5492648) (← links)
• Optimal ranking of tournaments (Q5645442) (← links)
• Graph theory (Q5917392) (← links)
• Extremal results on feedback arc sets in digraphs (Q6119220) (← links)
• Unavoidable structures in infinite tournaments (Q6602152) (← links)