The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Turán number of two vertex-disjoint copies of cliques

Caiyun Hu — 2024

Czechoslovak Mathematical Journal

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 , K p K q ) of a vertex-disjoint union of cliques K p and K q for all values of n .

Page 1

Download Results (CSV)