Different capacities of a digraph
The \(n\)-th Sperner power \(G^ n\) of a digraph \(G\) with vertex set \(V\) has vertex set \(V^ n\) and contains edges \((x_ 1x_ 2 \cdots x_ n, y_ 1y_ 2 \cdots y_ n)\) if and only if \(G\) contains edge \((x_ i, y_ i)\) for at least one \(i\), \(1 \leq i \leq n\). If \(C\) is a class of digraphs closed under Sperner products, let \(F(G^ n)\) denote the cardinality of the largest subgraph from \(C\) contained as an induced subgraph of \(G^ n\); then \(\lim_{n \to \infty}n^{ - 1} \cdot \log F (G^ n)\) may be called the \(C\)-capacity of \(G\). The authors derive upper and lower bounds for various capacity functions and investigate the conditions under which they are tight.
- A Sperner-type theorem and qualitative independence
- Capacities: From information theory to extremal set theory
- 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?)
- 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
- On the capacity of digraphs
- On clique growth in products of directed graphs
- Intersection number and capacities of graphs
- Partitioning transitive tournaments into isomorphic digraphs
- Sperner capacity of small digraphs
- On the capacity of graphs
- Local chromatic number and Sperner capacity
- Permutation capacities and oriented infinite paths
- Difference labelling of digraphs
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)
