Author:
Győri Ervin,Lemons Nathan
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference10 articles.
1. B. Bollobás: Modern Graph Theory, Springer, 1998.
2. B. Bollobás, E. Győri: Pentagons vs. triangles, Discrete Math. 308 (2008), 4332–4336.
3. J.A. Bondy and M. Simonovits: Cycles of even length in graphs, J. Combin. Theory B 16 (1974), 97–105.
4. P. Erdős and T. Gallai: On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar. 10 (1959), 337–356.
5. P. Erdős and M. Simonovits: A limit theorem in graph theory, Studia Sci. Math. Hungar. 1 (1966), 51–57.
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improved Lower Bounds for Multiplicative Square-Free Sequences;The Electronic Journal of Combinatorics;2023-12-01
2. Induced Turán problems and traces of hypergraphs;European Journal of Combinatorics;2023-06
3. Multicolor Ramsey Numbers for Berge cycles;The Electronic Journal of Combinatorics;2022-11-18
4. Hypergraphs with no tight cycles;Proceedings of the American Mathematical Society;2022-11-04
5. Turán numbers for hypergraph star forests;European Journal of Combinatorics;2022-05