Qualitative independence and Sperner problems for directed graphs (Q1199993): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q169304 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: László A. Székely / rank | |||
Normal rank |
Revision as of 03:38, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Qualitative independence and Sperner problems for directed graphs |
scientific article |
Statements
Qualitative independence and Sperner problems for directed graphs (English)
0 references
17 January 1993
0 references
Two \(k\)-partitions, \({\mathcal P}=\{P_ 1,\dots,P_ k\}\) and \({\mathcal P}'=\{P_ 1',\dots,P_ k'\}\) are called qualitatively independent, if \(P_ i\cap P_ j'\) is never empty. Let \(N(n,k)\) denote the largest size of a family of pairwise qualitative independent \(k\)-partitions on \(n\) elements. It is shown that \(\limsup_ n{1\over n}\log N(n,3)\geq.483\) and improved lower bounds are given also for \(4\leq k\leq 13\). The problem is related to that of the Shannon capacity of a graph.
0 references
qualitative independence
0 references
Sperner problems
0 references
directed graphs
0 references
Sperner family
0 references
\(k\)-partitions
0 references
Shannon capacity
0 references