BROWSE

Related Scientist

pascalgollin,jochen's photo.

pascalgollin,jochen
이산수학그룹
more info

ITEM VIEW & DOWNLOAD

Counting cliques in 1-planar graphs

Cited 0 time in webofscience Cited 0 time in scopus
192 Viewed 0 Downloaded
Title
Counting cliques in 1-planar graphs
Author(s)
J. Pascal Gollin; Kevin Hendrey; Methuku, Abhishek; Tompkins, Casey; Zhang, Xin
Publication Date
2023-03
Journal
European Journal of Combinatorics, v.109
Publisher
Academic Press
Abstract
© 2022 The Author(s)The problem of maximising the number of cliques among n-vertex 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.
URI
https://pr.ibs.re.kr/handle/8788114/13225
DOI
10.1016/j.ejc.2022.103654
ISSN
0195-6698
Appears in Collections:
Pioneer Research Center for Mathematical and Computational Sciences(수리 및 계산과학 연구단) > Discrete Mathematics Group(이산 수학 그룹) > 1. Journal Papers (저널논문)
Files in This Item:
There are no files associated with this item.

qrcode

  • facebook

    twitter

  • Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
해당 아이템을 이메일로 공유하기 원하시면 인증을 거치시기 바랍니다.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse