• Corpus ID: 239050226

Planar Tur\'an Number of Double Stars

@inproceedings{Ghosh2021PlanarTN,
  title={Planar Tur\'an Number of Double Stars},
  author={Debarun Ghosh and Ervin GyHori and Addisu Paulos and Chuanqi Xiao},
  year={2021}
}
Given a graph F , the planar Turán number of F , denoted exP(n, F ), is the maximum number of edges in an n-vertex F -free planar graph. Such an extremal graph problem was initiated by Dowden while determining sharp upper bound for exP(n,C4) and exP(n,C5), where C4 and C5 are cycles of length four and five respectively. In this paper we determined an upper bound for exP(n, S2,2), exP(n, S2,3), exP(n, S2,4), exP(n, S2,5), exP(n, S3,3) and exP(n, S3,4), where Sm,n is a double star with m and n… 

References

SHOWING 1-10 OF 12 REFERENCES
AN EXTREMAL PROBLEM IN GRAPH THEORY
G(?z; I) will denote a graph of n vertices and 1 edges. Let fO(lz, K) be the smallest integer such that there is a G (n; f,, (n, k)) in which for every set of K vertices there is a vertex joined to
Planar Turán Numbers of Short Paths
TLDR
The planar Turan number of paths P_k, the maximum number of edges in an H-free planar graph on n vertices, is determined with k=6,7,10,11.
On the structure of linear graphs
Denote byG(n; m) a graph ofn vertices andm edges. We prove that everyG(n; [n2/4]+1) contains a circuit ofl edges for every 3 ≦l<c2n, also that everyG(n; [n2/4]+1) contains ake(un, un) withun=[c1
ON MAXIMAL PATHS AND CIRCUITS OF GRAPHS
In 1940 TURIN raised the following question: if the number of nodes, n, of a graph’ is prescribed and if I is an integer cs n, what is the number of edges which the graph has to contain in order to
Extremal C4-Free/C5-Free Planar Graphs
  • Chris Dowden
  • Mathematics, Computer Science
    J. Graph Theory
  • 2016
We study the topic of “extremal” planar graphs, defining to be the maximum number of edges possible in a planar graph on n vertices that does not contain a given graph H as a subgraph. In particular,
Extremal H-Free Planar Graphs
TLDR
The topic of "extremal" planar graphs, that is, how many edges can an H-free planar graph on $n$ vertices have, is studied and ex_{_\mathcal{P}}(n,H) is defined to be the maximum number of edges.
Extremal Theta-free planar graphs
TLDR
The idea of determining the maximum number of edges in an $\mathcal{F}$-free planar graph on n vertices is promoted, and it is demonstrated that there are infinitely many values of $n$ for which they are attained exactly.
Planar Tur\'an number of the 6-cycle
Let ${\rm ex}_{\mathcal{P}}(n,T,H)$ denote the maximum number of copies of $T$ in an $n$-vertex planar graph which does not contain $H$ as a subgraph. When $T=K_2$, ${\rm ex}_{\mathcal{P}}(n,T,H)$ is
On the number of complete subgraphs contained in certain graphs
TLDR
The number of complete graphs of order 4 contained in certain graphs is counted to find the total number of graphs in the graph LaSalle's inequality.
Planar Turán Number of the Θ6
  • 2020
...
1
2
...