Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version-Reference-Cited by-同舟云学术

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

Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version

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

Author:

de Oliveira Bastos Josefran,Mota Guilherme Oliveira,Schacht Mathias,Schnitzer Jakob,Schulenburg Fabian

Funder

Fundação de Amparo à Pesquisa do Estado de São Paulo

Conselho Nacional de Desenvolvimento CientÃfico e Tecnológico

CAPES/DAAD PROBRAL

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior

Deutsche Forschungsgemeinschaft

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics

Link

https://epubs.siam.org/doi/pdf/10.1137/16M1065732

Reference16 articles.

1. Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs

2. Regularity lemmas for hypergraphs and quasi-randomness

3. The Uniformity Lemma for hypergraphs

4. Dirac-type results for loose Hamilton cycles in uniform hypergraphs

5. Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs

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

1. A general approach to transversal versions of Dirac‐type theorems;Bulletin of the London Mathematical Society;2023-07-30

2. Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs;Journal of Graph Theory;2023-05-24

3. On powers of tight Hamilton cycles in randomly perturbed hypergraphs;Random Structures & Algorithms;2023-04-17

4. Resilience for loose Hamilton cycles;Procedia Computer Science;2023

5. Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths;Journal of Graph Theory;2022-06-20

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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