共 50 条
Counting cliques in 1-planar graphs
被引:3
|作者:
Gollin, J. Pascal
[1
]
Hendrey, Kevin
[1
]
Methuku, Abhishek
[2
]
Tompkins, Casey
[3
]
Zhang, Xin
[4
]
机构:
[1] Inst Basic Sci IBS, Discrete Math Grp, 55 Expo ro, Daejeon 34126, South Korea
[2] Swiss Fed Inst Technol, Dept Math, Ramistr 101, CH-8092 Zurich, Switzerland
[3] Reny Inst Math, Realtanoda u 13-15, H-1053 Budapest, Hungary
[4] Xidian Univ, Sch Math & Stat, 266 Xifeng Rd, Xian 710126, Shaanxi, Peoples R China
基金:
英国工程与自然科学研究理事会;
关键词:
MAXIMUM NUMBER;
PENTAGONS;
D O I:
10.1016/j.ejc.2022.103654
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
The problem of maximising the number of cliques among nvertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of 1-planar graphs where we determine precisely the maximum total number of cliques as well as the maximum number of cliques of any fixed size. We also precisely characterise the extremal graphs for these problems. (c) 2022 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
引用
收藏
页数:27
相关论文