Different capacities of a digraph

DOI10.1007/BF02986655MaRDI QIDQ1334937zbMATH OpenOpenAlexFDO

Authors Luisa Gargano, János Körner, Gábor Simonyi, A. 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

capacitychromatic numberclique numberdigraphindependence graphsSperner powerSperner products

Mathematics Subject Classification ID

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

Recommendations

• Sperner capacity of small digraphs
• On the capacity of digraphs
• On clique growth in products of directed graphs
• On the Shannon capacity of a directed graph

Cites work

• scientific article; zbMATH DE number 3156376 (Why is no real title available?)
• scientific article; zbMATH DE number 3902654 (Why is no real title available?)
• scientific article; zbMATH DE number 3935081 (Why is no real title available?)
• scientific article; zbMATH DE number 3652272 (Why is no real title available?)
• A Sperner-type theorem and qualitative independence
• Capacities: From information theory to extremal set theory
• Normal hypergraphs and the perfect graph conjecture
• On the Shannon capacity of a graph
• On the Sperner capacity of the cyclic triangle
• Qualitative independence and Sperner problems for directed graphs
• Sperner capacities
• The Sperner capacity of linear and nonlinear codes for the cyclic triangle

Cited in

(6)

• Difference labelling of digraphs
• Intersection number and capacities of graphs
• Partitioning transitive tournaments into isomorphic digraphs
• Sperner capacity of small digraphs
• Local chromatic number and Sperner capacity
• On the capacity of graphs

This page was built for publication: Different capacities of a digraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334937)