Powers of tight Hamilton cycles in randomly perturbed hypergraphs

Author:

Bedenknecht Wiebke1,Han Jie2,Kohayakawa Yoshiharu3,Mota Guilherme O.4

Affiliation:

1. Fachbereich Mathematik Universität Hamburg Hamburg Germany

2. Department of Mathematics University of Rhode Island Kingston Rhode Island

3. Instituto de Matemática e Estatística Universidade de São Paulo Brazil

4. Centro de Matemática, Computação e Cognição Universidade Federal do ABC Brazil

Funder

FAPESP

CNPq

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Reference39 articles.

1. Tilings in randomly perturbed dense graphs;Balogh J.;Combin. Probab. Comput.,2018

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

3. Loose Hamiltonian cycles forced by large (k − 2)‐degree—Sharp version;Bastos J.deO.;Contrib. Discrete Math.,2018

4. How many random edges make a dense graph hamiltonian?

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

1. Cycle lengths in randomly perturbed graphs;Random Structures & Algorithms;2023-06-20

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

3. Large Rainbow Cliques in Randomly Perturbed Dense Graphs;SIAM Journal on Discrete Mathematics;2022-12

4. Hamiltonicity of graphs perturbed by a random regular graph;Random Structures & Algorithms;2022-11-11

5. Triangles in randomly perturbed graphs;Combinatorics, Probability and Computing;2022-07-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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