scientific article; zbMATH DE number 4200235

MaRDI QIDQ3348931zbMATH OpenFDO

Authors Ning Cai, Zhen Zhang, Rudolf Ahlswede

Publication date 1990

zbMATH Keywords

number of complete k-subgraphs of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30)

Recommendations

• scientific article; zbMATH DE number 3188526
• Bounds on the number of complete subgraphs
• An upper bound on the number of cliques in a graph
• On the number of complete subgraphs and circuits contained in graphs
• scientific article; zbMATH DE number 3843786

Cited in

(5)

• Handle bases and bounds on the number of subgraphs
• Bounds on the number of complete subgraphs
• The upper bound on the Eulerian recurrent lengths of complete graphs obtained by an IP solver
• A Remark on the Number of Complete and Empty Subgraphs
• Ning Cai: a tribute to a pioneering scholar in information theory

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 Q3348931)