3 research outputs found
Supersaturation Problem for the Bowtie
The Tur\'an function denotes the maximal number of edges in an
-free graph on vertices. We consider the function , the
minimal number of copies of in a graph on vertices with
edges. The value of has been extensively studied when is
bipartite or colour-critical. In this paper we investigate the simplest
remaining graph , namely, two triangles sharing a vertex, and establish the
asymptotic value of for .Comment: 23 pages, 1 figur
Spectral extremal graphs for the bowtie
Let be the (friendship) graph obtained from triangles by sharing a
common vertex. The -free graphs of order which attain the maximal
spectral radius was firstly characterized by Cioab\u{a}, Feng, Tait and Zhang
[Electron. J. Combin. 27 (4) (2020)], and later uniquely determined by Zhai,
Liu and Xue [Electron. J. Combin. 29 (3) (2022)] under the condition that
is sufficiently large. In this paper, we get rid of the condition on being
sufficiently large if . The graph is also known as the bowtie. We
show that the unique -vertex -free spectral extremal graph is the
balanced complete bipartite graph adding an edge in the vertex part with
smaller size if , and the condition is tight. Our result is a
spectral generalization of a theorem of Erd\H{o}s, F\"{u}redi, Gould and
Gunderson [J. Combin. Theory Ser. B 64 (1995)], which states that
. Moreover, we
study the spectral extremal problem for -free graphs with given number of
edges. In particular, we show that the unique -edge -free spectral
extremal graph is the join of with an independent set of
vertices if , and the condition is tight.Comment: 22 pages, 6 figures. This is the published versio
The exact minimum number of triangles in graphs of given order and size
What is the minimum number of triangles in a graph of given order and size?
Motivated by earlier results of Mantel and Tur\'an, Rademacher solved the first
non-trivial case of this problem in 1941. The problem was revived by Erd\H{o}s
in 1955; it is now known as the Erd\H{o}s-Rademacher problem. After attracting
much attention, it was solved asymptotically in a major breakthrough by
Razborov in 2008. In this paper, we provide an exact solution for all large
graphs whose edge density is bounded away from~, which in this range
confirms a conjecture of Lov\'asz and Simonovits from 1975. Furthermore, we
give a description of the extremal graphs.Comment: Published in Forum of Mathematics, Pi, Volume 8, e8 (2020