The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs-Reference-Cited by-同舟云学术

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

The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs

Published:2017-01 Issue:2 Volume:31 Page:1017-1071
ISSN:0895-4801
Container-title:SIAM Journal on Discrete Mathematics
language:en
Short-container-title:SIAM J. Discrete Math.

Author:

Hladký Jan,Komlós János,Piguet Diana,Simonovits Miklós,Stein Maya,Szemerédi Endre

Funder

Czech Ministry of Education

Czech Science Foundation

Nucleo Milenio Informacion y Coordinacion en Redes

Czech Academy of Sciences

Marie Curry Fellowship FIST

ERC-AdG

Deutsche Forschungsgemeinschaft

European Regional Development Fund

Seventh Framework Programme

Fondo Nacional de Desarrollo CientÃfico y TecnolÃ³gico

OrszÃ¡gos TudomÃ¡nyos KutatÃ¡si Alapprogramok

Engineering and Physical Sciences Research Council

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics

Link

https://epubs.siam.org/doi/pdf/10.1137/140982866

Reference8 articles.

1. The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition

2. The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs

3. The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs

4. The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result

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

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

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

3. A version of the Loebl–Komlós–Sós conjecture for skew trees;European Journal of Combinatorics;2020-08

4. Maximum and Minimum Degree Conditions for Embedding Trees;SIAM Journal on Discrete Mathematics;2020-01

5. The Turán number of spanning star forests;Discussiones Mathematicae Graph Theory;2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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