Maximum and Minimum Degree Conditions for Embedding Trees-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Maximum and Minimum Degree Conditions for Embedding Trees

Published:2020-01 Issue:4 Volume:34 Page:2108-2123
ISSN:0895-4801
Container-title:SIAM Journal on Discrete Mathematics
language:en
Short-container-title:SIAM J. Discrete Math.

Author:

Besomi Guido,Pavez-Signé Matías,Stein Maya

Funder

Fondo Nacional de Desarrollo Científico y Tecnológico

Comisión Nacional de Investigación Científica y Tecnológica

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics

Link

https://epubs.siam.org/doi/pdf/10.1137/19M1277667

Reference20 articles.

1. Degree Conditions for Embedding Trees

2. The Erdős-Sós conjecture for graphs of girth 5

3. Proof of the Loebl–Komlós–Sós conjecture for large, dense graphs

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

1. Antidirected subgraphs of oriented graphs;Combinatorics, Probability and Computing;2024-03-06

2. Graphs of minimum degree at least ⌊d/2⌋ and large enough maximum degree embed every tree with d vertices;Procedia Computer Science;2023

3. Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result;Journal of Graph Theory;2022-10-07

4. Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result;Journal of Graph Theory;2022-10-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP