On The Number of Subgraphs of Prescribed Type of Planar Graphs With A Given Number of Vertices

N. Alon; Y. Caro

doi:10.1016/S0304-0208(08)72803-2

On The Number of Subgraphs of Prescribed Type of Planar Graphs With A Given Number of Vertices

N. Alon, Y. Caro

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

For a planar graph H and a positive integer n we study the maximal number f = f(n, H), such that there exists a planar graph on n vertices containing f subgraphs isomorphic to H. We determine f(n, H) precisely if H is either a complete bipartite (planar) graph or a maximal planar graph without triangles that are not faces, and estimate f(n, H) for every maximal planar graph H.

Original language	English (US)
Pages (from-to)	25-36
Number of pages	12
Journal	North-Holland Mathematics Studies
Volume	87
Issue number	C
DOIs	https://doi.org/10.1016/S0304-0208(08)72803-2
State	Published - 1984
Externally published	Yes

All Science Journal Classification (ASJC) codes

General Mathematics

Access to Document

10.1016/S0304-0208(08)72803-2

Cite this

@article{0948d2c083d94b698549f78a71b40195,

title = "On The Number of Subgraphs of Prescribed Type of Planar Graphs With A Given Number of Vertices",

abstract = "For a planar graph H and a positive integer n we study the maximal number f = f(n, H), such that there exists a planar graph on n vertices containing f subgraphs isomorphic to H. We determine f(n, H) precisely if H is either a complete bipartite (planar) graph or a maximal planar graph without triangles that are not faces, and estimate f(n, H) for every maximal planar graph H.",

author = "N. Alon and Y. Caro",

year = "1984",

doi = "10.1016/S0304-0208(08)72803-2",

language = "English (US)",

volume = "87",

pages = "25--36",

journal = "North-Holland Mathematics Studies",

issn = "0304-0208",

publisher = "Elsevier B.V.",

number = "C",

}

TY - JOUR

T1 - On The Number of Subgraphs of Prescribed Type of Planar Graphs With A Given Number of Vertices

AU - Alon, N.

AU - Caro, Y.

PY - 1984

Y1 - 1984

N2 - For a planar graph H and a positive integer n we study the maximal number f = f(n, H), such that there exists a planar graph on n vertices containing f subgraphs isomorphic to H. We determine f(n, H) precisely if H is either a complete bipartite (planar) graph or a maximal planar graph without triangles that are not faces, and estimate f(n, H) for every maximal planar graph H.

AB - For a planar graph H and a positive integer n we study the maximal number f = f(n, H), such that there exists a planar graph on n vertices containing f subgraphs isomorphic to H. We determine f(n, H) precisely if H is either a complete bipartite (planar) graph or a maximal planar graph without triangles that are not faces, and estimate f(n, H) for every maximal planar graph H.

UR - https://www.scopus.com/pages/publications/77956909323

UR - https://www.scopus.com/inward/citedby.url?scp=77956909323&partnerID=8YFLogxK

U2 - 10.1016/S0304-0208(08)72803-2

DO - 10.1016/S0304-0208(08)72803-2

M3 - Article

AN - SCOPUS:77956909323

SN - 0304-0208

VL - 87

SP - 25

EP - 36

JO - North-Holland Mathematics Studies

JF - North-Holland Mathematics Studies

IS - C

ER -

On The Number of Subgraphs of Prescribed Type of Planar Graphs With A Given Number of Vertices

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this