当前位置:
X-MOL 学术
›
Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
The maximum number of paths of length four in a planar graph
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-02-19 , DOI: 10.1016/j.disc.2021.112317 Debarun Ghosh , Ervin Győri , Ryan R. Martin , Addisu Paulos , Nika Salia , Chuanqi Xiao , Oscar Zamora
中文翻译:
平面图中长度为4的最大路径数
更新日期:2021-02-19
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-02-19 , DOI: 10.1016/j.disc.2021.112317 Debarun Ghosh , Ervin Győri , Ryan R. Martin , Addisu Paulos , Nika Salia , Chuanqi Xiao , Oscar Zamora
Let denote the maximum number of copies of in an -vertex planar graph. The order of magnitude of , where is a path on vertices, is . In this paper we determine the asymptotic value of and give conjectures for longer paths.
中文翻译:
平面图中长度为4的最大路径数
让 表示的最大副本数 在一个 -顶点平面图。数量级, 在哪里 是一条路 顶点是 。在本文中,我们确定的渐近值 并给出更长的路径的猜想。