scientific article; zbMATH DE number 4132192

MaRDI QIDQ3033788zbMATH OpenFDO

Authors Sul-young Choi

Publication date 1989

zbMATH Keywords

Johnson graphmaximal t-cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• On the large maximal \(\{ 0,1,2,\dots,t\}\)-cliques in Hamming graph \(H(n,q)\)
• Large maximal \(\{ 0,1,2,\dots,t\}\)-cliques of the \(q\)-analog of the Johnson graph
• Embedding maximal cliques of sets in maximal cliques of bigger sets
• scientific article; zbMATH DE number 3933899
• On the maximal clique problem

Cited in

(6)

• Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs
• Token graphs
• Large maximal \(\{ 0,1,2,\dots,t\}\)-cliques of the \(q\)-analog of the Johnson graph
• On the large maximal \(\{ 0,1,2,\dots,t\}\)-cliques in Hamming graph \(H(n,q)\)
• Maximal Binary Cliques
• scientific article; zbMATH DE number 3933899 (Why is no real title available?)

This page was built for publication:

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