Digraphs that contain at most t distinct walks of a given length with the same endpoints-Reference-Cited by-同舟云学术

Digraphs that contain at most t distinct walks of a given length with the same endpoints

Published:2021-03-04 Issue:3 Volume:41 Page:762-779
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Lyu Zhenhua^ORCID

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-021-00718-0.pdf

Reference22 articles.

1. Bollobás B (1995) Extremal graph theory, Handbook of Combinatorics, vol 2. Elsevier, Amsterdam, pp 1231–1292

2. Brown WG, Erdős P, Simonovits M (1973) Extremal problems for directed graphs. J Combin Theor Ser B 15:77–93

3. Brown WG, Erdős P, Simonovits M (1985) Algorithmic solution of extremal digraph problems. Trans Am Math Soc 292:421–449

4. Brown WG, Harary F (1970) Extremal digraphs, combinatorial theory and its applications. Colloq Math Soc Janos Bolyai 4I:135–198

5. Brown WG, Simonovits M (2002) Extremal multigraph and digraph problems, Paul Erdős and his mathematics, II (Budapest, 1999), 157-203, Bolyai Soc. Math. Stud., 11, János Bolyai Math. Soc., Budapest

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

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

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

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

4. Extremal Digraphs Avoiding an Orientation of the Diamond;Graphs and Combinatorics;2021-05-11