The binomial k-clique

DOI10.1002/JCD.21333zbMATH Open1260.05104OpenAlexW1908321054MaRDI QIDQ4909342FDOQ4909342

Sharad Sane, Nithya Sai Narayana

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

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

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)

Cites Work

• Inequalities for minimal covering sets in set systems of given rank
• More on maximal intersecting families of finite sets
• On maximal intersecting families of finite sets
• Minimum number of elements of representing a set system of given rank
• Title not available (Why is that?)
• Embedding maximal cliques of sets in maximal cliques of bigger sets
• Title not available (Why is that?)
• Maximal Intersecting Families of Finite Sets and n-Uniform Hjelmslev Planes

Cited In (2)

• Maximal Binary Cliques
• 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)