Supersaturation Problem for the Bowtie
classification
🧮 math.CO
keywords
graphedgesfunctionnumbervalueverticesasymptoticbeen
pith:7YR44VHH Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{7YR44VHH}
Prints a linked pith:7YR44VHH badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
The Tur\'an function $ex(n,F)$ denotes the maximal number of edges in an $F$-free graph on $n$ vertices. We consider the function $h_F(n,q)$, the minimal number of copies of $F$ in a graph on $n$ vertices with $ex(n,F)+q$ edges. The value of $h_F(n,q)$ has been extensively studied when $F$ is bipartite or colour-critical. In this paper we investigate the simplest remaining graph $F$, namely, two triangles sharing a vertex, and establish the asymptotic value of $h_F(n,q)$ for $q=o(n^2)$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.