11 research outputs found
The planar Tur\'an number of and
Let be a set of graphs. The planar Tur\'an number,
, is the maximum number of edges in an
-vertex planar graph which does not contain any member of as a
subgraph. When has only one element, we usually write
instead. The topic of extremal planar graphs was
initiated by Dowden (2016). He obtained sharp upper bound for both
and . Later on, we obtained
sharper bound for . In this paper, we give upper
bounds of and
. We also give constructions
which show the bounds are tight for infinitely many graphs.Comment: 11 pages, 11 figures. arXiv admin note: text overlap with
arXiv:2307.0690
Dense circuit graphs and the planar Tur\'an number of a cycle
The of a
graph is the maximum number of edges in an -vertex planar graph without
as a subgraph. Let denote the cycle of length . The planar Tur\'an
number is known for . We show that
dense planar graphs with a certain connectivity property (known as circuit
graphs) contain large near triangulations, and we use this result to obtain
consequences for planar Tur\'an numbers. In particular, we prove that there is
a constant so that for all . When this bound is tight up to
the constant and proves a conjecture of Cranston, Lidick\'y, Liu, and
Shantanam
The planar Tur\'an number of the seven-cycle
The planar Tur\'an number, , is the maximum number of
edges in an -vertex planar graph which does not contain as a subgraph.
The topic of extremal planar graphs was initiated by Dowden (2016). He obtained
sharp upper bound for both and .
Later on, D. Ghosh et al. obtained sharp upper bound of
and proposed a conjecture on for . In this
paper, we give a sharp upper bound , which satisfies the conjecture of D. Ghosh et al. It turns
out that this upper bound is also sharp for ,
the maximum number of edges in an -vertex planar graph which does not
contain or as a subgraph
Planar Tur\'an Number of the
Let be a graph. The planar Tur\'an number of , denoted by
, is the maximum number of edges in an -vertex
planar graph containing no copy of as a subgraph. Let denote the
family of Theta graphs on vertices, that is, a graph obtained by
joining a pair of non-consecutive vertices of a -cycle with an edge. Y. Lan,
et.al. determined sharp upper bound for
and . Moreover, they obtained an upper
bound for . They proved that,
. In this
paper, we improve their result by giving a bound which is sharp. In particular,
we prove that and demonstrate that there are infinitely many
for which there exists a -free planar graph on vertices,
which attains the bound.Comment: 23 pages, 19 figure
Planar Tur\'an number of the 7-cycle
The of a
graph is the maximum number of edges in an -vertex planar graph without
as a subgraph. Let denote the cycle of length . The planar
Tur\'an number behaves differently for
and for , and it is known when .
We prove that for all , and show that equality holds for infinitely
many integers
Subgraph densities in a surface
Given a fixed graph that embeds in a surface , what is the
maximum number of copies of in an -vertex graph that embeds in
? We show that the answer is , where is a
graph invariant called the `flap-number' of , which is independent of
. This simultaneously answers two open problems posed by Eppstein
(1993). When is a complete graph we give more precise answers.Comment: v4: referee's comments implemented. v3: proof of the main theorem
fully rewritten, fixes a serious error in the previous version found by Kevin
Hendre