On the maximum cardinality of a consistent set of arcs in a random tournament

No abstract is available for this paper.

• Publication year

  1983

• Venue

  J. Comb. Theory B

• Publication date

  1983-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/0095-8956(83)90060-6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Optimally ranking unrankable tournaments

  1980cited by this paper
• Optimal ranking of tournaments

  1971cited by this paper
• On Sets of Consistent Arcs in a Tournament

  1965cited by this paper
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

  1952cited by this paper

• Making an oriented graph acyclic using inversions of bounded or prescribed size

  2025cites this paper
• A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number

  2025cites this paper
• Dynamic Parameterized Feedback Problems in Tournaments

  2024cites this paper
• Inference of rankings planted in random tournaments

  2024influential citation
• On the Minimum Number of Inversions to Make a Digraph k ‐(Arc‐)Strong

  2023cites this paper
• On Tournament Inversion

  2023cites this paper
• Spectral Slater index of tournaments

  2022influential citation
• Extremal results on feedback arc sets in digraphs

  2022cites this paper
• Invertibility of digraphs and tournaments

  2022cites this paper
• Tournament Quasirandomness from Local Counting

  2021cites this paper
• All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint k-Cliques (and This Is Tight)

  2021cites this paper
• Paths with many shortcuts in tournaments

  2020cites this paper
• Dominant tournament families

  2020cites this paper
• University of Birmingham Tournament quasirandomness from local counting

  2020cites this paper
• Tournament Quasirandomness from Local Counting

  2019cites this paper
• A constructive solution to a problem of ranking tournaments

  2019influential citation
• On Explicit Random-Like Tournaments

  2019cites this paper
• Tournaments and Semicomplete Digraphs

  2018cites this paper
• Chaining Mutual Information and Tightening Generalization Bounds

  2018cites this paper
• Proof of an entropy conjecture of Leighton and Moitra

  2017cites this paper
• A treatise on the binomial theorem

  2017cites this paper
• Intersections of random hypergraphs and tournaments

  2015cites this paper
• The Erdős Existence Argument

  2013cites this paper
• Color Coding, Multilinear Detection, and Randomized Divide and Conquer

  2013cites this paper
• Arc‐Disjoint Cycles and Feedback Arc Sets

  2012cites this paper
• On Entropy and Extensions of Posets

  2011cites this paper
• Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data

  2011cites this paper
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

  2010cites this paper
• Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments

  2010cites this paper
• New Methods in Parameterized Algorithms and Complexity

  2009cites this paper
• Voting Procedures, Complexity of

  2009cites this paper
• Fast FAST

  2009cites this paper
• How to Rank with Fewer Errors A PTAS for Feedback Arc Set in Tournaments

  2009cites this paper
• Approximation Schemes for Dense Variants of Feedback Arc Set , Correlation Clustering , and Other Fragile Min Constraint Satisfaction Problems

  2009cites this paper
• Almost Given Length Cycles in Digraphs

  2008cites this paper
• How to rank with few errors

  2007cites this paper
• A survey on the linear ordering problem for weighted or unweighted tournaments

  2007cites this paper
• How to Rank with Few Errors A PTAS for Weighted Feedback Arc Set on Tournaments ∗

  2007cites this paper
• How to rank with few errors A PTAS for Weighted Feedback Arc Set on Tournaments

  2006cites this paper
• How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments

  2006cites this paper
• Digraphs - theory, algorithms and applications

  2002cites this paper
• Voting paradoxes and digraphs realizations

  2002influential citation
• Realizing tournaments by orderings

  2002influential citation
• The Probablistic Method

  2000cites this paper
• Constructive Quasi-Ramsey Numbers and Tournament Ranking

  1999cites this paper
• The Probabilistic Method

  1998cites this paper
• Tight Bounds for the Maximum Acyclic Subgraph Problem

  1997cites this paper
• Ordres médians et ordres de Slater des tournois

  1996cites this paper
• The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown

  1996cites this paper
• Tournaments as Feedback Arc Sets

  1995cites this paper
• The Reversing Number of a Digraph

  1995cites this paper
• A FAST EFFECTIVE HEURISTIC FOR THE FEEDBACK ARC SET PROBLEM

  1993cites this paper
• A Fast and Effective Heuristic for the Feedback Arc Set Problem

  1993cites this paper
• The fourth moment method

  1991cites this paper
• Approximation Algorithms for the Maximum Acyclic Subgraph Problem

  1990cites this paper
• On cutting-plane proofs in combinatorial optimization

  1989cites this paper
• Combinatorics by Coin Flipping

  1986cites this paper
• Probabilistic methods

  1985cites this paper
• Matrices with large permanent [ 7 ]

  year unknowncites this paper