The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph-Reference-Cited by-同舟云学术

The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph

Published:2017-06 Issue:6 Volume:340 Page:1172-1179
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Cooley Oliver,Mycroft Richard

Funder

EPSRC grant

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference27 articles.

1. Tight cycles and regular slices in dense hypergraphs;Allen;J. Combin. Theory Ser. A,2017

2. J.O. Bastos, G.O. Mota, M. Schacht, J. Schnitzer, F. Schulenburg, Loose Hamiltonian cycles forced by large (k-2)-degree – approximate version, arXiv:1603.04180

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

4. Tight codegree condition for the existence of loose Hamilton cycles in 3-graphs;Czygrinow;SIAM J. Discrete Math.,2014

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

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

1. Minimum degree conditions for tight Hamilton cycles;Journal of the London Mathematical Society;2022-04-11

2. Degree Conditions for Tight Hamilton Cycles;Trends in Mathematics;2021

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

4. Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs;Proceedings of the London Mathematical Society;2019-02-12

5. Embedding Graphs into Larger Graphs: Results, Methods, and Problems;Bolyai Society Mathematical Studies;2019