登录 注册 会员服务 联系我们

The maximum number of paths of length three in a planar graph

  • Published:2022-04-19 Issue:3 Volume:101 Page:493-510
  • ISSN:0364-9024
  • Container-title:Journal of Graph Theory
  • language:en
  • Short-container-title:Journal of Graph Theory

Author:

Grzesik Andrzej1ORCID,Győri Ervin23ORCID,Paulos Addisu34,Salia Nika23ORCID,Tompkins Casey56,Zamora Oscar37

Affiliation:

1. Jagiellonian University Kraków Poland

2. Alfréd Rényi Institute of Mathematics Budapest Hungary

3. Central European University Budapest Hungary

4. Addis Ababa University Addis Ababa Ethiopia

5. Discrete Mathematics Group Institute for Basic Science (IBS) Daejeon Republic of Korea

6. Karlsruhe Institute of Technology Karlsruhe Germany

7. Centro de Investigación en Matemática Pura y Aplicada (CIMPA), Escuela de Matemática Universidad de Costa Rica San José Costa Rica

Funder

Shota Rustaveli National Science Foundation

European Research Council

Nemzeti Kutatási Fejlesztési és Innovációs Hivatal

Institute for Basic Science

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference28 articles.

1. On the number of cycles of length 4 in a maximal planar graph

2. On the number of subgraphs of prescribed type of planar graphs with a given number of vertices;Alon N.;Annals Disc. Math,1984

3. Many T copies in H-free graphs

4. Additive Approximation of Generalized Turán Questions

5. Pentagons vs. triangles

Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3