Skip to main navigation Skip to search Skip to main content

2-factors in dense graphs

  • Noga Alon*
  • , Eldar Fischer
  • *Corresponding author for this work
  • Tel Aviv University

Research output: Contribution to journal › Article › peer-review

36 Scopus citations

Abstract

A conjecture of Sauer and Spencer states that any graph G on n vertices with minimum degree at least 2/3 n contains any graph H on n vertices with maximum degree 2 or less. This conjecture is proven here for all sufficiently large n.

Original languageEnglish
Pages (from-to)13-23
Number of pages11
JournalDiscrete Mathematics
Volume152
Issue number1-3
DOIs
StatePublished - 20 May 1996

Fingerprint

Dive into the research topics of '2-factors in dense graphs'. Together they form a unique fingerprint.

Cite this