Skip to main content
SpringerLink
Log in

Proof of the Erdős–Faudree Conjecture on Quadrilaterals

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

Abstract

In this paper, we prove the Erdős–Faudree’s conjecture: If G is a graph of order 4k and the minimum degree of G is at least 2k then G contains k disjoint cycles of length 4.

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

References

  1. Bollobás B.: Extremal Graph Theory. Academic Press, London (1978)

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. El-Zahar M.H.: On circuits in graphs. Discrete Math. 50, 227–230 (1984)

    Article  MathSciNet  Google Scholar 

  4. Erdős, P.: Some recent combinatorial problems, Technical Report, University of Bielefeld (1990)

  5. Komlós J., Sárközy G.N., Szemerédi E.: Proof of the Alon-Yuster conjecture. Discrete Math. 235, 255–269 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Randerath B., Schiermeyer I., Wang H.: On quadrilaterals in a graph. Discrete Math. 203, 229–237 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Wang H.: On quadrilaterals in a graph. Discrete Math. 288, 149–166 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The University of Idaho, Moscow, ID, 83844-1103, USA

    Hong Wang

Authors
  1. Hong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hong Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, H. Proof of the Erdős–Faudree Conjecture on Quadrilaterals. Graphs and Combinatorics 26, 833–877 (2010). https://doi.org/10.1007/s00373-010-0948-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-010-0948-3

Keywords

Search

Navigation