More on maximal intersecting families of finite sets

DOI10.1016/0097-3165(87)90036-7zbMath0608.05005OpenAlexW2056056023MaRDI QIDQ1086235

Aart Blokhuis

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(87)90036-7

zbMATH Keywords

families of setsmaximal k-clique

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05)

Related Items

A note on saturation for $k$-wise intersecting families, Saturating Sperner families, Maximal intersection critical families of finite sets, Problems and results on 1-cross-intersecting set pair systems, The Binomial k‐Clique, Maximal intersecting families and affine regular polygons in \(PG(2,q)\), Matchings and covers in hypergraphs, Local constraints ensuring small representing sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of exterior lines of certain sets of points in PG(2,q)
• On maximal intersecting families of finite sets
• Covering finite fields with cosets of subspaces
• The blocking number of an affine space
• Maximal Intersecting Families of Finite Sets and n-Uniform Hjelmslev Planes
• On the difference between consecutive primes