Different capacities of a digraph (Q1334937): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02986655 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2017752667 / rank | |||
Normal rank |
Latest revision as of 08:29, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Different capacities of a digraph |
scientific article |
Statements
Different capacities of a digraph (English)
0 references
26 September 1994
0 references
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.
0 references
clique number
0 references
chromatic number
0 references
independence graphs
0 references
Sperner power
0 references
digraph
0 references
Sperner products
0 references
capacity
0 references