Intersecting families of discrete structures are typically trivial (Q2258906)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6409139
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Intersecting families of discrete structures are typically trivial |
scientific article; zbMATH DE number 6409139 |
Statements
Intersecting families of discrete structures are typically trivial (English)
0 references
27 February 2015
0 references
extremal combinatorics
0 references
intersecting families
0 references
Erdős-Ko-Rado theorem
0 references
permutations
0 references
hypergraphs
0 references
vector spaces
0 references
Bollobás set-pairs
0 references
Kneser graph
0 references
random hypergraphs
0 references
0 references
0 references
0.8393713235855103
0 references
0.8129397034645081
0 references
0.8126773238182068
0 references
0.7991490364074707
0 references
0.7938416004180908
0 references
