Linear dependencies among subsets of a finite set

DOI10.1016/S0195-6698(83)80027-4MaRDI QIDQ788726zbMATH OpenWikidataFDO

Authors Peter Frankl, N. M. Singhi

Publication date 1983

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

zbMATH Keywords

family of setsextremal set theory0-design

Mathematics Subject Classification ID

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

Recommendations

• An extremal set theoretical characterization of some Steiner systems
• The minimum independence number for designs
• scientific article; zbMATH DE number 3880717
• Using the existence of \(t\)-designs to prove Erdős-Ko-Rado
• The exact bound in the Erdős-Ko-Rado theorem

Cites work

• scientific article; zbMATH DE number 3561377 (Why is no real title available?)
• scientific article; zbMATH DE number 3639656 (Why is no real title available?)
• An intersection problem for finite sets
• Extremal problems and coverings of the space
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems for systems of finite sets
• Intersection theorems with geometric consequences
• On families of finite sets no two of which intersect in a singleton
• On the Structure oft-Designs
• The module structure of integral designs

Cited in

(8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q788726)