On clique-extremal (p,q)-graphs

DOI10.1002/NET.3230040408zbMATH Open0309.05125OpenAlexW1980738673MaRDI QIDQ4067140FDOQ4067140

Authors: Abraham Lempel, Frank Harary 

Publication date: 1974

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230040408

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (2)

• On the maximum number of cliques in a graph
• The maximum number of cliques in dense graphs

This page was built for publication: On clique-extremal (p,q)-graphs

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