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.
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.
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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The Turán number of a given graph , denoted by , is the maximum number of edges in an -free graph on vertices. Applying a well-known result of Hajnal and Szemerédi, we determine the Turán number ) of a vertex-disjoint union of cliques and for all values of .
Download Results (CSV)