Embedding maximal cliques of sets in maximal cliques of bigger sets

DOI10.1016/0012-365X(86)90140-8zbMath0596.05038MaRDI QIDQ1078196

David A. Drake

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

incidence structuremaximal k-clique

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (3)

The Binomial k‐Clique ⋮ Maximal intersecting families and affine regular polygons in \(PG(2,q)\) ⋮ Matchings and covers in hypergraphs

Cites Work

• On maximal intersecting families of finite sets
• Finite nets. II: Uniqueness and imbedding
• Maximal Intersecting Families of Finite Sets and n-Uniform Hjelmslev Planes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Embedding maximal cliques of sets in maximal cliques of bigger sets