"The maximum number of cliques in graphs that avoid vertex-disjoint copies ..."

Zhipeng Gao et al. (2026)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2025.114859

access: closed

type: Journal Article

metadata version: 2025-10-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/GaoLLSY26
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/GaoLLSY26
Zhipeng Gao, Ping Li, Changhong Lu, Rui Sun, Long-Tu Yuan:
The maximum number of cliques in graphs that avoid vertex-disjoint copies of path of length two. Discret. Math. 349(3): 114859 (2026)

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.