Author:
Gerbner Dániel,Nagy Dániel T.,Patkós Balázs,Salia Nika,Vizer Máté
Funder
Magyar Tudományos Akadémia
National Research, Development and Innovation Office
Ministry of Education and Science of the Russian Federation
Reference13 articles.
1. Connected graphs without long paths;Balister;Discrete Math.,2008
2. An Erdős–Gallai type theorem for uniform hypergraphs;Davoodi;European J. Combin.,2018
3. On maximal paths and circuits of graphs;Erdős;Acta Math. Acad. Sci. Hung.,1959
4. Path Ramsey numbers in multicolorings;Faudree;J. Combin. Theory Ser. B,1975
5. Avoiding long berge-cycles;Füredi;J. Combin. Theory Ser. B,2019
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pósa-Type Results for Berge Hypergraphs;The Electronic Journal of Combinatorics;2024-05-31