The Binomial k‐Clique

DOI10.1002/jcd.21333zbMath1260.05104OpenAlexW1908321054MaRDI QIDQ4909342

Nithya Sai Narayana, Sharad S. Sane

Publication date: 13 March 2013

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21333

zbMATH Keywords

hypergraphprojective planeuniform hypergraphcliquebinomial cliquemaximal \(k\)-clique

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Embedding maximal cliques of sets in maximal cliques of bigger sets
• More on maximal intersecting families of finite sets
• On maximal intersecting families of finite sets
• Inequalities for minimal covering sets in set systems of given rank
• Minimum number of elements of representing a set system of given rank
• Maximal Intersecting Families of Finite Sets and n-Uniform Hjelmslev Planes

This page was built for publication: The Binomial k‐Clique