Győri, Ervin and Addisu, Paulos and Salia, Nika and Tompkins, Casey and Zamora, O. (2021) The Maximum Number of Paths of Length Three in a Planar Graph. In: Trends in Mathematics. Trends in Mathematics (14). Springer Science and Business Media Deutschland GmbH, pp. 262-266.
|
Text
1909.13539v2.pdf - Published Version Download (216kB) | Preview |
Abstract
Let f(n, H) denote the maximum number of copies of H possible in an n-vertex planar graph. The function f(n, H) has been determined when H is a cycle of length 3 or 4 by Hakimi and Schmeichel and when H is a complete bipartite graph with smaller part of size 1 or 2 by Alon and Caro. We determine f(n, H) exactly in the case when H is a path of length 3. © 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.
| Item Type: | Book Section |
|---|---|
| Additional Information: | Export Date: 17 July 2025; Cited By: 1; Correspondence Address: A. Paulos; Addis Ababa University, Addis Ababa, Ethiopia; email: addisu_2004@yahoo.com |
| Uncontrolled Keywords: | planar graph; Apollonian networks; Maximal planar graph; |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 21 Jul 2025 12:22 |
| Last Modified: | 21 Jul 2025 12:22 |
| URI: | https://real.mtak.hu/id/eprint/221245 |
Actions (login required)
 |
Edit Item |
