On the average size of sets in intersecting Sperner families

13 years 4 months ago

Download fma2.math.uni-magdeburg.de

We show that the average size of subsets of [n] forming an intersecting Sperner family of cardinality not less than (n-1 k-1 ) is at least k provided that k 6 n=2

Christian Bey, Konrad Engel, Gyula O. H. Katona, U

Real-time Traffic

Average Size | DM 2002 | N-1 K-1 | Sperner Family |

claim paper

» Helly numbers of acyclic families

» Maximal Intersection Queries in Randomized Input Models

» Maximal Intersection Queries in Randomized Graph Models

» Crossing Families

» Contraction and Expansion of Convex Sets

» FBT filled buffer technique to reduce code size for VLIW processors

» Trimmed Moebius Inversion and Graphs of Bounded Degree

» How Good are Convex Hull Algorithms

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	DM
Authors	Christian Bey, Konrad Engel, Gyula O. H. Katona, Uwe Leck

Comments (0)

Sciweavers

On the average size of sets in intersecting Sperner families

Average Size | DM 2002 | N-1 K-1 | Sperner Family |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers