Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Reference14 articles.
1. Alon, N., Shikhelman, C.: Many $$T$$ copies in $$H$$-free graphs. J. Combin. Theory Ser. B 121, 146–172 (2016)
2. Bondy, J.A., Chvátal, V.: A method in graph theory. Discrete Math. 15, 111–135 (1976)
3. Chakraborti, D., Chen, D.: Many cliques with few edges and bounded maximum degree. J. Combin. Theory Ser. B 151, 1–20 (2021)
4. Duan, X., Ning, B., Peng, X., et al.: Maximizing the number of cliques in graphs with given matching number. Discrete Appl. Math. 287, 110–117 (2020)
5. Erdős, P.: On the number of complete subgraphs contained in certain graphs. Magy. Tud. Akad. Mat. Kut. Intéz. Közl. 7, 459–474 (1962)