On the capacity of digraphs

DOI10.1006/eujc.1997.0148zbMath0894.05031OpenAlexW2055579046MaRDI QIDQ1378288

Noga Alon

Publication date: 7 September 1998

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

Full work available at URL: https://semanticscholar.org/paper/de8978106fd539cc7a7744e21402f4796c687c0a

zbMATH Keywords

digraphcapacitytournament

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

New lower bounds for the Shannon capacity of odd cycles ⋮ Algorithmic and explicit determination of the Lovász number for certain circulant graphs ⋮ Sets in $ {\mathbb{Z}}_m$ whose difference sets avoid squares ⋮ Hyperbolic fibrations and \(q\)-clans ⋮ Algorithms for finding maximum transitive subtournaments ⋮ Local chromatic number and Sperner capacity ⋮ Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles

This page was built for publication: On the capacity of digraphs