A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints-Reference-Cited by-同舟云学术

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

A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints

Published:2019-06 Issue:6 Volume:342 Page:1703-1717
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Huang Zejun,Lyu Zhenhua,Qiao Pu

Funder

NSFC

Fundamental Research Fund for the Central Universities

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference29 articles.

1. Extremal graph theory;Bollobás,1995

2. Cycles of even length in graphs;Bondy;J. Combin. Theory Ser. B,1974

3. Extremal problems for directed graphs;Brown;J. Combin. Theory Ser. B,1973

4. Algorithmic solution of extremal digraph problems;Brown;Trans. Amer. Math. Soc.,1985

5. Extremal digraphs;Brown,1970

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

1. The Turán number of directed paths and oriented cycles;Graphs and Combinatorics;2023-04-08

2. Turán Problems for k-Geodetic Digraphs;Graphs and Combinatorics;2023-02-20

3. Extremal digraphs avoiding distinct walks of length 3 with the same endpoints;Discrete Mathematics;2022-10

4. Turán number of 3-free strong digraphs with out-degree restriction;Discrete Applied Mathematics;2022-06

5. A Note on Extremal Digraphs Containing at Most t Walks of Length k with the Same Endpoints;Graphs and Combinatorics;2022-02-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP