Different capacities of a digraph

DOI10.1007/BF02986655zbMath0804.05040OpenAlexW2017752667MaRDI QIDQ1334937

János Körner, Gábor Simonyi, Luisa Gargano, Anna Galluccio

Publication date: 26 September 1994

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02986655

zbMATH Keywords

digraphcapacitychromatic numberclique numberindependence graphsSperner powerSperner products

Mathematics Subject Classification ID

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

Related Items

Partitioning transitive tournaments into isomorphic digraphs ⋮ Local chromatic number and Sperner capacity

Cites Work

• On the Sperner capacity of the cyclic triangle
• The Sperner capacity of linear and nonlinear codes for the cyclic triangle
• A Sperner-type theorem and qualitative independence
• Qualitative independence and Sperner problems for directed graphs
• Capacities: From information theory to extremal set theory
• Sperner capacities
• Normal hypergraphs and the perfect graph conjecture
• On the Shannon capacity of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item