Skip to main content
Log in

On Degree Sum Conditions and Vertex-Disjoint Chorded Cycles

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In this paper, we consider a general degree sum condition sufficient to imply the existence of k vertex-disjoint chorded cycles in a graph G. Let \(\sigma _t(G)\) be the minimum degree sum of t independent vertices of G. We prove that if G is a graph of sufficiently large order and \(\sigma _t(G)\ge 3kt-t+1\) with \(k\ge 1\), then G contains k vertex-disjoint chorded cycles. We also show that the degree sum condition on \(\sigma _t(G)\) is sharp. To do this, we also investigate graphs without chorded cycles.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Chiba, S., Fujita, S., Gao, Y., Li, G.: On a sharp degree sum condition for disjoint chorded cycles in graphs. Graphs Combin. 26(2), 173–186 (2010)

    Article  MathSciNet  Google Scholar 

  2. Corrádi, K., Hajnal, A.: On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hungar. 14(3–4), 423–439 (1963)

    Article  MathSciNet  Google Scholar 

  3. Enomoto, H.: On the existence of disjoint cycles in a graph. Combinatorica 18(4), 487–492 (1998)

    Article  MathSciNet  Google Scholar 

  4. Finkel, D.: On the number of independent chorded cycles in a graph. Discrete Math. 308(22), 5265–5268 (2008)

    Article  MathSciNet  Google Scholar 

  5. Fujita, S., Matsumura, H., Tsugaki, M., Yamashita, T.: Degree sum conditions and vertex-disjoint cycles in a graph. Australas. J. Combin. 35, 237–251 (2006)

    MathSciNet  MATH  Google Scholar 

  6. Gould, R.J.: Graph Theory. Dover Pub. Inc., Mineola, N.Y. (2012)

    MATH  Google Scholar 

  7. Gould, R.J., Hirohata, K., Keller, A.: On vertex-disjoint cycles and degree sum conditions. Discrete Math. 341(1), 203–212 (2018)

    Article  MathSciNet  Google Scholar 

  8. Gould, R.J., Hirohata, K., Keller, A.: On independent triples and vertex-disjoint chorded cycles in graphs. Australas. J. Combin. 77(Part 3), 355–372 (2020)

    MATH  Google Scholar 

  9. Harary, F., Prins, G.: The block-cutpoint-tree of a graph. Publ. Math. Debr. 13, 103–107 (1966)

    MathSciNet  MATH  Google Scholar 

  10. Ma, F., Yan, J.: The confirmation of a conjecture on disjoint cycles in a graph. Discrete Math. 341(10), 2903–2911 (2018)

    Article  MathSciNet  Google Scholar 

  11. Wang, H.: On the maximum number of independent cycles in a graph. Discrete Math. 205(1–3), 183–190 (1999)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the referees for their suggestions and comments, and thank Ariel Keller Rorabaugh for the helpful insights she provided. The second author is supported by the Heilbrun Distinguished Emeritus Fellowship from Emory University Emeritus College. The third author is supported by Japan Society for the Promotion of Science KAKENHI Grant Number JP19K03610.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bradley Elliott.

Additional information

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Elliott, B., Gould, R.J. & Hirohata, K. On Degree Sum Conditions and Vertex-Disjoint Chorded Cycles. Graphs and Combinatorics 36, 1927–1945 (2020). https://doi.org/10.1007/s00373-020-02227-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-020-02227-z

Keywords

Navigation