\(4n-10\) (Q1764478)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 4n-10 |
scientific article; zbMATH DE number 2138556
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(4n-10\) |
scientific article; zbMATH DE number 2138556 |
Statements
\(4n-10\) (English)
0 references
25 February 2005
0 references
The paper proves that the maximum number of splits in a 2-compatible split system on \(n\) vertices is \(4n-10\) for all \(n>3.\) With this it also gives the exact answer (which is \(8n-20\)) to the question of A. Karzanov, raised in 1979, about the maximum number of members in any 3-cross-free collection of subsets of an \(n\)-set.
0 references
3-cross-free set systems
0 references
crossing set system
0 references
split system
0 references
multicommodity flow
0 references
0.8227383494377136
0 references
0.7878542542457581
0 references
0.7844696044921875
0 references
0.7844696044921875
0 references
