The binomial k-clique

DOI10.1002/JCD.21333MaRDI QIDQ4909342zbMATH OpenOpenAlexFDO

Authors Nithya Sai Narayana, Sharad 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

cliquehypergraphuniform hypergraphprojective planebinomial cliquemaximal \(k\)-clique

Mathematics Subject Classification ID

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

Recommendations

• On the maximal clique problem
• More on maximal intersecting families of finite sets
• scientific article; zbMATH DE number 3933899
• Embedding maximal cliques of sets in maximal cliques of bigger sets
• scientific article; zbMATH DE number 4057513

Cites work

• scientific article; zbMATH DE number 3933899 (Why is no real title available?)
• scientific article; zbMATH DE number 4057513 (Why is no real title available?)
• Embedding maximal cliques of sets in maximal cliques of bigger sets
• Inequalities for minimal covering sets in set systems of given rank
• Maximal Intersecting Families of Finite Sets and n-Uniform Hjelmslev Planes
• Minimum number of elements of representing a set system of given rank
• More on maximal intersecting families of finite sets
• On maximal intersecting families of finite sets

Cited in

(3)

• Maximal Binary Cliques
• On the maximal clique problem
• Embedding maximal cliques of sets in maximal cliques of bigger sets

This page was built for publication: The binomial \(k\)-clique

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