"The maximum number of cliques in dense graphs."

Bruce Hedman (1985)

> Home

Details and statistics

DOI: 10.1016/0012-365X(85)90077-9

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/Hedman85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Hedman85
Bruce Hedman:
The maximum number of cliques in dense graphs. Discret. Math. 54(2): 161-166 (1985)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.