Skip to main content
SpringerLink
Log in

On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

We give simple sufficient degree conditions for uniform hypergraphs to be k-edge-connected or super edge-connected and strongest monotone increasing degree conditions for uniform hypergraphs to be k-edge-connected when \(k=1,2,3\). As corollaries, we obtain the sufficient degree conditions for k-edge-connected graphs given by Bauer et al. (Networks 54(2):95–98, 2009) and the minimum degree conditions for maximally edge-connected (Chartrand, SIAM J Appl Math 14(4):778–781, 1966; Dankelmann and Meierling, Discrete Math 339(2):33–38, 2016) and super edge-connected (Kelman, Theory Probab Appl 17(2):243–254, 1972; Zhao et al., Graphs Combin 36(4):1065–1078, 2020) uniform hypergraphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Data availability

Not applicable.

References

  1. Bauer D, Hakimi SL, Kahl N, Schmeichel E (2009) Sufficient degree conditions for \(k\)-edge-connectedness of a graph. Networks 54(2):95–98

    Article  MathSciNet  MATH  Google Scholar 

  2. Berge C (1989) Hypergraphs: Combinatorics of Finite Sets. North-Holland, Amsterdam

    MATH  Google Scholar 

  3. Boesch FT (1974) The strongest monotone degree condition for \(n\)-connectedness of a graph. J Comb Theory Ser B 16(2):162–165

    Article  MathSciNet  MATH  Google Scholar 

  4. Bondy JA (1969) Properties of graphs with constraints on degrees. Studia Sci Math Hung 4:473–475

    MathSciNet  MATH  Google Scholar 

  5. Chartrand G (1966) A graph-theoretic approach to a communications problem. SIAM J Appl Math 14(4):778–781

    Article  MathSciNet  MATH  Google Scholar 

  6. Chvátal V (1972) On Hamilton’s ideals. J Comb Theory Ser B 12(2):163–168

    Article  MathSciNet  MATH  Google Scholar 

  7. Dankelmann P, Meierling D (2016) Maximally edge-connected hypergraphs. Discrete Math 339(2):33–38

    Article  MathSciNet  MATH  Google Scholar 

  8. Dewar M, Pike D, Proos J (2018) Connectivity in hypergraphs. Canad Math Bull 61(2):252–271

    Article  MathSciNet  MATH  Google Scholar 

  9. Dirac GA (1952) Some theorems on abstract graphs. Proc Lond Math Soc 3(1):68–81

    MathSciNet  MATH  Google Scholar 

  10. Gu XF, Lai HJ (2013) Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs. Discrete Math 313(12):1394–1400

    Article  MathSciNet  MATH  Google Scholar 

  11. Kelman AK (1972) Asymptonic formulas for the probability of \(k\)-connectedness of random graphs. Theory Probab Appl 17(2):243–254

    Google Scholar 

  12. Kriesell M (2017) Degree sequences and edge connectivity. Abh Math Semin Univ Hambg 87(2):343–355

    Article  MathSciNet  MATH  Google Scholar 

  13. Liu XM, Meng JX, Tian YZ (2022) On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences. Discrete Appl Math 321:10–18

    Article  MathSciNet  MATH  Google Scholar 

  14. Liu XM, Meng JX, Tian YZ (2022) On forcibly \(k\)-connected uniform hypergraphic sequences. (submitted for publication)

  15. Nash-Williams CSJA (1971) Hamiltonian arcs and circuits. In: Recent Trends in Graph Theory Lecture Notes in Mathematics. Springer, pp 197–210

  16. Shan EF, Zhao J, Zhao LY (2019) Maximally connected \(p\)-partite uniform hypergraphs. Discrete Appl Math 264:188–195

    Article  MathSciNet  MATH  Google Scholar 

  17. Tong LK, Shan EF (2021) Sufficient conditions for maximally edge-connected hypergraphs. J Oper Res Soc China 9(1):119–129

    Article  MathSciNet  MATH  Google Scholar 

  18. Yin JH, Guo JY (2022) A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected. Acta Math Appl Sinica (Engl Ser) 38(1):223–228

    Article  MathSciNet  MATH  Google Scholar 

  19. Zhao S, Meng JX (2018) Sufficient conditions for hypergraphs to be maximally edge-connected hypergraphs. Appl Math Comput 333:362–368

    Article  MathSciNet  MATH  Google Scholar 

  20. Zhao S, Tian YZ, Meng JX (2020) Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs. Graphs Combin 36(4):1065–1078

    Article  MathSciNet  MATH  Google Scholar 

Download references

Funding

This research was supported by Natural Science Foundation of Xinjiang, China (No. 2020D04046), National Natural Science Foundation of China (No. 12261086).

Author information

Authors and Affiliations

  1. College of Mathematics and System Sciences, Xinjiang University, Urumqi, 830046, Xinjiang, People’s Republic of China

    Xuemei Liu, Jixiang Meng & Yingzhi Tian

Authors
  1. Xuemei Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jixiang Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yingzhi Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Liu contributed to conceptualization, methodology, and writing—original draft; Meng contributed to writing—review and editing; Tian contributed to writing—review and editing.

Corresponding author

Correspondence to Jixiang Meng.

Ethics declarations

Ethical approval

Not applicable.

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

The research is supported by NSFXJ (2020D04046), NSFC (12261086).

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, X., Meng, J. & Tian, Y. On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences. J Supercomput 79, 15980–15996 (2023). https://doi.org/10.1007/s11227-023-05287-z

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-023-05287-z

Keywords

Search

Navigation