Jia-Jin Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Jia-Jin Wang has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Bo-Jun Yuan
School of Science Zhejiang University of Science and Technology 310023 Hangzhou P. R. China
2 shared publications - Shi-Cai Gong
School of Science, Zhejiang University of Science and Technology, Hangzhou, People’s Republic of China
2 shared publications - Xin-Hao Zhu
School of Science, Zhejiang University of Science and Technology, Hangzhou, People’s Republic of China
2 shared publications
Latest Publications
- 25 May 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 45 (10) , 404
Efficient enumeration of cliques in graphs with bounded maximum degree
- 25 May 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 45 (10) , 404
Efficient enumeration of cliques in graphs with bounded maximum degree
- Open Access
Efficient Enumeration of Cliques in Graphs with Bounded Maximum Degree
In recent years, there has been a surge of interest in extremal problems concerning the enumeration of independent sets or cliques in graphs with specific constraints. For instance, the Kahn-Zhao theorem establishes an upper bound on the number of independent sets in a $d$-regular graph. Building on this, Cutler and Radcliffe extended the result by identifying the graph that maximizes the number of cliques among graphs with bounded order and maximum degree. In this paper, we introduce an innovative approach for counting cliques in graphs with a bounded maximum degree. To demonstrate the effectiveness of the method, we provide a new proof for the above Cutler-Radcliffe theorem and the Kahn-Zhao theorem.
Open AccessEfficient Enumeration of Cliques in Graphs with Bounded Maximum Degree
In recent years, there has been a surge of interest in extremal problems concerning the enumeration of independent sets or cliques in graphs with specific constraints. For instance, the Kahn-Zhao theorem establishes an upper bound on the number of independent sets in a $d$-regular graph. Building on this, Cutler and Radcliffe extended the result by identifying the graph that maximizes the number of cliques among graphs with bounded order and maximum degree. In this paper, we introduce an innovative approach for counting cliques in graphs with a bounded maximum degree. To demonstrate the effectiveness of the method, we provide a new proof for the above Cutler-Radcliffe theorem and the Kahn-Zhao theorem.