Hamilton cycles in quasirandom hypergraphs-Reference-Cited by-同舟云学术

Hamilton cycles in quasirandom hypergraphs

Published:2016-02-26 Issue:2 Volume:49 Page:363-378
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct. Alg.

Author:

Lenz John¹,Mubayi Dhruv¹,Mycroft Richard²

Affiliation:

1. University of Illinois at Chicago

2. University of Birmingham

Publisher

Wiley

Subject

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

Link

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

Reference26 articles.

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

2. J.-C. Bermond A. Germa M.-C. Heydemann D. Sotteau Hypergraphes hamiltoniens, Problèmes combinatoires et théorie des graphes (Colloqium Internatational CNRS 1978 39 43

3. Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs;Buß;J Combin Theory Ser B,2013

4. Quasi-random graphs;Chung;Combinatorica,1989

5. Some theorems on abstract graphs;Dirac;Proc London Math Soc,1952

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

1. Hamiltonicity in Cherry-quasirandom 3-graphs;European Journal of Combinatorics;2022-05

2. Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs;SIAM Journal on Discrete Mathematics;2022-01-06

3. Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs;Random Structures & Algorithms;2021-10-14

4. Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs;Combinatorics, Probability and Computing;2020-10-12