Density results for uniform families
type: Item
instance of: scholarly article
title: Density results for uniform families
zbMATH Open document ID: 0795.05138
DOI: 10.1007/BF01305954
author: V. Pereyra
published in: Combinatorica
publication date: 1994-05-10T00:00:00Z
review text: Assume that a \(k\)-partite family is given on some sets with \(n_ 1, \dots, n_ k\) elements. If the family has more than \(n_ 1n_ 2 \dots n_ k-(n_ 1-1) (n_ 2-1) \dots (n_ k-1)\) elements then there is a \(k\)-element set \(A\) all subsets of which occur as the intersection of some set in the family with \(A\). The proof goes by evaluating the rank of a certain matrix.
Mathematics Subject Classification ID: 05D05
Mathematics Subject Classification ID: 15A03
zbMATH DE Number: 567476
zbMATH Keywords: uniform families
zbMATH Keywords: \(k\)-partite family
reviewed by: Péter Komjáth
MaRDI profile type: Publication
cites work: On the density of sets of vectors
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: On the trace of finite sets
cites work: An extremal problem for two families of sets
cites work: On the number of sets in a null t-design
cites work: Intersection patterns of convex sets
cites work: On the density of families of sets
cites work: A combinatorial problem; stability and order for models and theories in infinitary languages
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
description: scientific article; zbMATH DE number 567476