On Erdős's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received February 6, 1997

RID="*"

ID="*" The research of the author was supported by NSERC research grant OGP0025112.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Franek, F. On Erdős's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6. Combinatorica 22, 451–454 (2002). https://doi.org/10.1007/s004930200024

Download citation

  • AMS Subject Classification (1991) Classes:  05C04