Funder
IBS
NKFIH
Institute for Basic Science
Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
National Research, Development and Innovation Office
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. An Erdős-Gallai type theorem for uniform hypergraphs;Davoodi;Eur. J. Comb.,2018
2. On some problems in graph theory, combinatorial analysis and combinatorial number theory;Erdős,1984
3. On maximal paths and circuits of graphs;Erdős;Acta Math. Hung.,1959
4. Exact solution of some Turán-type problems;Frankl;J. Comb. Theory, Ser. A,1987
5. Linear trees in uniform hypergraphs;Füredi;Eur. J. Comb.,2014
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. How connectivity affects the extremal number of trees;Journal of Combinatorial Theory, Series B;2024-07
2. How connectivity affects the extremal number of trees;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023