Author:
Saclé Jean-François,Woźniak Mariusz
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference5 articles.
1. The Erdős–Sós conjecture for graphs of girth 5;Brandt;Discrete Math.,1996
2. E. Dobson, Trees in graphs with large girth
3. On maximal paths and circuits of graphs;Erdős;Acta Math. Acad. Sci. Hungar.,1959
4. On the Erdős–Sós conjecture;Woźniak;J. Graph Theory,1996
5. M. Woźniak, Packing of graphs, Disertationes Math.
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. How connectivity affects the extremal number of trees;Journal of Combinatorial Theory, Series B;2024-07
2. A Spectral Bipartite Analogue of the Erd\H{O}S-S\'{O}S Conjecture;2024
3. A Spectral Erdős-Sós Theorem;SIAM Journal on Discrete Mathematics;2023-09-26
4. An Aα-Spectral Erdős-Sós Theorem;The Electronic Journal of Combinatorics;2023-09-22
5. Strong 2-degenerate graph embeddings;Discrete Mathematics, Algorithms and Applications;2023-02-02