"H-free subgraphs of dense graphs maximizing the number of cliques and ..."

Noga Alon, Clara Shikhelman (2019)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2018.11.012

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/AlonS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/AlonS19
Noga Alon, Clara Shikhelman:
H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups. Discret. Math. 342(4): 988-996 (2019)

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.