On some extremal problems in graph theory

Research output: Contribution to journalArticle

70 Citations (Scopus)


The author proves that if C is a sufficiently large constant then every graph of n vertices and [Cn 3/2] edges contains a hexagon X 1, X 2, X 3, X 4, X 5, X 6 and a seventh vertex Y joined to X 1, X 3 and X 5. The problem is left open whether our graph contains the edges of a cube, (i.e. an eight vertex Z joined to X 2, X 4 and X 6).

Original languageEnglish
Pages (from-to)113-116
Number of pages4
JournalIsrael Journal of Mathematics
Issue number2
Publication statusPublished - Jun 1 1965


ASJC Scopus subject areas

  • Mathematics(all)

Cite this