Edge-disjoint Hamilton cycles in random graphs-Reference-Cited by-同舟云学术

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

Edge-disjoint Hamilton cycles in random graphs

Published:2013-07-02 Issue:3 Volume:46 Page:397-445
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct. Alg.

Author:

Knox Fiachra¹,Kühn Daniela²,Osthus Deryk²

Affiliation:

1. School of Mathematical Sciences, Faculty of Science and Engineering, Queen Mary; University of London; London E1, 4NS UK

2. School of Mathematics, College of Engineering and Physical Sciences; University of Birmingham Edgbaston; Birmingham B15 2TT UK

Funder

EPSRC

ERC

Publisher

Wiley

Subject

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

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/rsa.20510/fullpdf

Reference33 articles.

1. Decomposition into Cycles I: Hamilton Decompositions

2. Paley graphs have Hamilton decompositions;Alspach;Discrete Math,2012

3. Packing tight Hamilton cycles in uniform hypergraphs;Bal;SIAM J Discrete Math,2012

4. On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs;Ben-Shimon;SIAM J Discrete Math,2011

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

1. Perfect Matchings in Random Sparsifications of Dirac Hypergraphs;Combinatorica;2024-08-05

2. Many Hamiltonian subsets in large graphs with given density;Combinatorics, Probability and Computing;2023-10-02

3. Threshold for Steiner triple systems;Geometric and Functional Analysis;2023-06-19

4. Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor;T AM MATH SOC;2023-04-05

5. The Existence of Designs via Iterative Absorption: Hypergraph -designs for Arbitrary;Memoirs of the American Mathematical Society;2023-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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