Extremal Graphs for Two Vertex-Disjoint Copies of a Clique

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

Applying a well-known result of Hajnal and Szemerédi, we determine the Turán number of two vertex-disjoint copies of a clique.

Original languageEnglish
Article number67
JournalGraphs and Combinatorics
Volume38
Issue number3
DOIs
StatePublished - Jun 2022

Keywords

  • Clique
  • Extremal graph
  • Hajnal and Szemeréd theorem

Fingerprint

Dive into the research topics of 'Extremal Graphs for Two Vertex-Disjoint Copies of a Clique'. Together they form a unique fingerprint.

Cite this