The maximum number of cliques in graphs that avoid vertex-disjoint copies of path of length two

Zhipeng Gao, Ping Li, Changhong Lu, Rui Sun, Long-Tu YuanDiscret. Math 2026 · DOI

BibTeX
@article{gao2026maximum,
  author = {Zhipeng Gao and Ping Li and Changhong Lu and Rui Sun and Long-Tu Yuan},
  title = {{The maximum number of cliques in graphs that avoid vertex-disjoint copies of path of length two}},
  journal = {Discret. Math.},
  year = {2026},
  doi = {10.1016/j.disc.2025.114859},
}
Figure