Indexed by：
Abstract：
The Turán number of a given graph H, denoted by ex(n, H), is the maximum number of edges in an H-free graph on n vertices. Applying a well-known result of Hajnal and Szemerédi, we determine the Turán number ex(n, Kp ∪ Kq) of a vertex-disjoint union of cliques Kp and Kq for all values of n. © Institute of Mathematics, Czech Academy of Sciences 2024.
Keyword：
Reprint 's Address：
Email：
Source ：
Czechoslovak Mathematical Journal
ISSN： 0011-4642
Year： 2024
Issue： 3
Volume： 74
Page： 759-769
0 . 4 0 0
JCR@2023
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
