Extremal Problems for Finite SetsPeter Frankl |
Contents
CONTENTS 35 | 5 |
R AHLSWEDE AND NING CAI On Sets of Words with Pairwise | 25 |
N ALON Probabilistic Methods in Extremal Finite Set Theory | 39 |
Copyright | |
20 other sections not shown
Other editions - View all
Common terms and phrases
A₁ affine plane algorithm antichain asymptotic b₁ blocks Bollobás Boolean functions Calderbank collinear colors Combinatorial component Conjecture consider contains Corollary critical cardinality D. J. Kleitman defined delta-systems denote desarguesian plane dimension Discrete Math disjoint elements equality Erdős Erdős-Ko-Rado theorem example exists Extremal Problems Finite Sets fixed Frankl Füredi graph holds hypergraph hyperstars implies inequality integer intersecting isoperimetric problem ISP-system Katona Kruskal-Katona Theorem least Lemma Let H linear Lovász lower bound lower units Mathematics maximal maximum number monotone Boolean functions n-element set number of edges obtained optimal subset order q pairs partition plane of order points polynomial polyomino poset projective plane proof of Theorem proved quasi-symmetric r-graph r-uniform random result satisfying Section self-dual codes self-maps sequence Sperner families Sperner's theorem star-shaped polygon subgraphs Suppose symmetric Theorem 2.1 Theory Turán Tuza uniform hypergraphs upper bound vector vertex set Visegrád