Set Systems without a Strong Simplex

A d-simplex is a collection of d + 1 sets such that every d of them have non-empty intersection and the intersection of all of them is empty. A strong d-simplex is a collection of d + 2 sets A, A1, . . . , Ad+1 such that {A1, . . . , Ad+1} is a d-simplex, while A contains

• Type: Journal
• Year: 2010
• Where: SIAMDM
• Authors: Tao Jiang, Oleg Pikhurko, Zelealem Yilma
• Keywords: Non-empty Intersection, SIAMDM 2010