Name
Abstract | ||
|---|---|---|
For a planar graph H, let N-p(n, H) denote the maximum number of copies of H in an n-vertex planar graph. In this paper, we prove that N-p(n, P-7) similar to 4/27n(4), N-p(n, C-6)similar to (n/3)(3), N-p(n, C-8) similar to (n/4)(4), and N-p(n, K-4 {1}) similar to (n/6)(6), where K-4{1} is the 1-subdivision of K-4. In addition, we obtain significantly improved upper bounds on N-p(n, P2m+1) and N-p(n, C-2m) for m >= 4. For a wide class of graphs H, the key technique developed in this paper allows us to bound N-p(n, H) in terms of an optimization problem over weighted graphs. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1002/jgt.22838 | JOURNAL OF GRAPH THEORY |
Keywords | DocType | Volume |
extremal graph theory, planar graphs, weighted graphs | Journal | 101 |
Issue | ISSN | Citations |
3 | 0364-9024 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christopher Cox | 1 | 5 | 6.92 |
| Ryan R. Martin | 2 | 36 | 10.12 |