Linear dependencies among subsets of a finite set

DOI10.1016/S0195-6698(83)80027-4zbMath0532.05006WikidataQ114656088 ScholiaQ114656088MaRDI QIDQ788726

Navin M. Singhi, Peter Frankl

Publication date: 1983

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

extremal set theoryfamily of sets0-design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Permutations, words, matrices (05A05) Extremal set theory (05D05)

Related Items (7)

Exact solution of some Turán-type problems ⋮ Non \(t\)-intersecting families of linear spaces over \(GF(q)\) ⋮ On functions of strength t ⋮ On hypergraphs without two edges intersecting in a given number of vertices ⋮ Specified intersections ⋮ Forbidding just one intersection ⋮ An extremal problem for Graham-Rothschild parameter words

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal problems and coverings of the space
• Intersection theorems with geometric consequences
• The module structure of integral designs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the Structure oft-Designs
• On families of finite sets no two of which intersect in a singleton
• An intersection problem for finite sets
• Intersection theorems for systems of finite sets

This page was built for publication: Linear dependencies among subsets of a finite set