Intersections of random hypergraphs and tournaments

DOI10.1016/j.ejc.2014.08.023zbMath1302.05165OpenAlexW2021070567MaRDI QIDQ472404

Béla Bollobás, Alexander D. Scott

Publication date: 19 November 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2014.08.023

zbMATH Keywords

negative discrepancy discrandom tournaments

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximum cardinality of a consistent set of arcs in a random tournament
• Optimally ranking unrankable tournaments
• Tournament solutions and majority voting
• Links between the Slater index and the Ryser index of tournaments
• Intersections of graphs
• Cutting a graph into two dissimilar halves
• Tournament Ranking with Expected Profit in Polynomial Time
• Constructive Quasi-Ramsey Numbers and Tournament Ranking
• Tight Bounds for the Maximum Acyclic Subgraph Problem
• On Sets of Consistent Arcs in a Tournament
• On Sets of Arcs Containing No Cycles in a Tournament*
• Optimal ranking of tournaments
• Imbalances in k‐colorations

This page was built for publication: Intersections of random hypergraphs and tournaments