ISSN 0253-2778

CN 34-1054/N

open
Free to Publish. Free to Read.
Open AccessOpen Access JUSTC Original Paper

Ore-type condition for loose Hamilton cycles in 3-uniform hypergraphs

Cite this: JUSTC, 2020, 50(5): 669-672
https://doi.org/10.3969/j.issn.0253-2778.2020.05.014
More Information
  • Author Bio:

    YU Lei, male, born in 1990,PhD.Research field: Geometry and analysis.

  • Received Date: June 07, 2019
  • Revised Date: October 14, 2019
  • Accepted Date: October 14, 2019
  • Published Date: May 30, 2020
    Abstract
  • A classic result of Ore in 1960 states that if the degree sum of any two independent vertices in an n-vertex graph is at least n, then the graph is Hamiltonian. Here a similar problem for 3-uniform hypergraph was studied and an approximate result was obtained.
    • FullText(HTML)
    References (4)
    Related Articles
    Track Citations

Catalog

    Get Citation
    {{if article.pdfAccess}}
    {{if article.articleBusiness.pdfLink && article.articleBusiness.pdfLink != ''}} {{else}} {{/if}}PDF
    {{/if}}
    XML
    [1]
    ORE O. A note on Hamiltonian circuits[J]. Amer. Math Monthly, 1960, 67: 55.
    [2]
    TANG Y, YAN G. An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs[J]. Discrete Math, 2017, 340: 1528-1534.
    [3]
    CZYGRINOW A, MOLLA T. Tight codegree condition for the existence of loose Hamilton cycles in 3-graphs[J]. SIAM J. Discrete Math, 2014, 28(1): 67-76.
    [4]
    HN H, SCHACHT M. Dirac-type results for loose Hamilton cycles in uniform hypergraphs[J]. J.Comb. Theory Ser. B, 2010, 100: 332-346.)

    Related Articles

    [1]Jie Wu, Yumeng Wu. Machine learning in data envelopment analysis: A smart mechanism for indicator selection[J]. JUSTC, 2022, 52(12): 5-1-5-9. DOI: 10.52396/JUSTC-2022-0106
    [2]CUI Wenquan, YU Houying, HOU Xiaotian. Focused loss-based for imbalanced data scenarios integrated classification methods for CGAN[J]. JUSTC, 2020, 50(7): 968-976. DOI: 10.3969/j.issn.0253-2778.2020.07.014
    [3]LIU Weikang, QIN Xiaowei, WEI Guo. Service identification of WeChat traffic based on fuzziness and semi-supervised self-paced co-training[J]. JUSTC, 2020, 50(1): 29-38. DOI: 10.3969/j.issn.0253-2778.2020.01.004
    [4]CUI Wenquan, HUANG Yuqiao. A new random projection-based ensemble classifier for high-dimensional data[J]. JUSTC, 2019, 49(12): 974-984. DOI: 10.3969/j.issn.0253-2778.2019.12.004
    [5]QI Peng, KUANG Sen. Time-optimal control of open quantum ensembles based on sampling and learning[J]. JUSTC, 2019, 49(10): 775-780. DOI: 10.3969/j.issn.0253-2778.2019.10.001
    [6]HE Jiezhou, LIU Jinping, ZHANG Wuxia, MA Tianyu, TANG Zhaohui, XU Pengfei. Selective ensemble of online sequential adaption ELMS-based adaptive network intrusion detection[J]. JUSTC, 2019, 49(7): 544-554. DOI: 10.3969/j.issn.0253-2778.2019.07.004
    [7]SUN Yange, WANG Zhihai, YUAN Jidong, BAI Yang. Adaptive ensemble classification algorithm for data streams based on information entropy[J]. JUSTC, 2017, 47(7): 575-582. DOI: 10.3969/j.issn.0253-2778.2017.07.005
    [8]ZHU Wei, YAN Shixing, ZHANG Lei, LI Guozheng. Insomnia discriminant analysis based on real-world clinical data[J]. JUSTC, 2016, 46(10): 867-873. DOI: 10.3969/j.issn.0253-2778.2016.10.011
    [9]SHI Peibei, LIU Guiquan, WANG Zhong, WEI Bing. A hierarchical classification model for class-imbalanced data[J]. JUSTC, 2015, 45(1): 61-68. DOI: 10.3969/j.issn.0253-2778.2015.01.010
    [10]LI Quan-wei, WAN Tian-bin, QIN Jun, LIAO Guang-xuan. Intelligent fire detection based on unsupervised learning clustering algorithm of Dignet[J]. JUSTC, 2009, 39(7): 769-776.
    TrendMD
    2020 No. 5 Volume 50 Issue 5 PP. 669-672
    Cover

    Article Metrics

    Article views (162) PDF downloads (382)

    Copyright © Editorial Office of JUSTC, All Rights Reserved. 皖ICP备05002528号

    Supported by: Beijing Renhe Information Technology Co., Ltd.  Baidu Analytics

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return