Intersecting families of discrete structures are typically trivial
METADATA ONLY
Loading...
Author / Producer
Date
2015-05
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
132
Pages / Article No.
224 - 245
Publisher
Elsevier
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Extremal combinatorics; Intersecting families; Erdős-Ko-Rado; Permutations; Hypergraphs; Vector spaces; Bollobás set-pairs; Kneser graph; Random hypergraphs
Organisational unit
Notes
Received 11 August 2014, Available online 26 January 2015.