On maximal intersecting families of finite sets

DOI10.1016/0097-3165(80)90071-0zbMath0438.05002OpenAlexW2055299804MaRDI QIDQ1141651

Zoltan Fueredi

Publication date: 1980

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(80)90071-0

zbMATH Keywords

maximal clique

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (14)

Embedding maximal cliques of sets in maximal cliques of bigger sets ⋮ More on maximal intersecting families of finite sets ⋮ Saturating Sperner families ⋮ On intersecting hypergraphs ⋮ Maximal intersection critical families of finite sets ⋮ Saturation problems in convex geometric hypergraphs ⋮ The Binomial k‐Clique ⋮ Game saturation of intersecting families ⋮ Saturation problems in the Ramsey theory of graphs, posets and point sets ⋮ Maximal intersecting families and affine regular polygons in \(PG(2,q)\) ⋮ Matchings and covers in hypergraphs ⋮ Squeezing the accordion in a strongly n-uniform Hjelmslev plane ⋮ Covering pairs by \(q^ 2+q+1\) sets ⋮ The Game Saturation Number of a Graph

Cites Work

• Extremal problems among subsets of a set
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On maximal intersecting families of finite sets