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

A variant of the Erdős‐Sós conjecture

  • Published:2019-11-08 Issue:1 Volume:94 Page:131-158
  • ISSN:0364-9024
  • Container-title:Journal of Graph Theory
  • language:en
  • Short-container-title:J. Graph Theory

Author:

Havet Frédéric1ORCID,Reed Bruce12,Stein Maya3ORCID,Wood David R.4ORCID

Affiliation:

1. CNRSProjet COATI, I3S (CNRS and UNS) UMR7271 and INRIA Sophia Antipolis France

2. School of Computer ScienceMcGill University Montréal Canada

3. Department of Mathematical Engineering and Center for Mathematical Modeling (UMI 2807 CNRS)Universidad de Chile Santiago Chile

4. School of MathematicsMonash University Melbourne Australia

Funder

Australian Research Council

Agence Nationale de la Recherche

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

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

1. Oriented Trees and Paths in Digraphs;Surveys in Combinatorics 2024;2024-06-13

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. Beyond the Erdős–Sós conjecture;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023

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

5. 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

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3