On supersaturation and stability for generalized Turán problems

Anastasia Halfpap, Cory Palmer

Research output: Contribution to journalArticlepeer-review

Abstract

Fix a graph (Formula presented.). We say that a graph is (Formula presented.) -free if it contains no copy of (Formula presented.) as a subgraph. Let (Formula presented.) denote the maximum number of copies of a graph (Formula presented.) in an (Formula presented.) -vertex (Formula presented.) -free graph. In this note, we will give a new general supersaturation result for (Formula presented.) in the case when (Formula presented.) as well as a new proof of a stability theorem for (Formula presented.).

Original languageEnglish
Pages (from-to)232-240
Number of pages9
JournalJournal of Graph Theory
Volume97
Issue number2
DOIs
StatePublished - Jun 2021

Keywords

  • stability
  • supersaturation
  • Turán number

Fingerprint

Dive into the research topics of 'On supersaturation and stability for generalized Turán problems'. Together they form a unique fingerprint.

Cite this