On some extremal problems in graph theory

Research output: Contribution to journalArticle

67 Citations (Scopus)

Abstract

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
Volume3
Issue number2
DOIs
Publication statusPublished - Jun 1965

Fingerprint

Extremal Problems
Graph theory
Graph in graph theory
Vertex of a graph
Hexagon
Regular hexahedron

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

On some extremal problems in graph theory. / Erdős, P.

In: Israel Journal of Mathematics, Vol. 3, No. 2, 06.1965, p. 113-116.

Research output: Contribution to journalArticle

@article{cc672890b4044023ac9f50d9a94b5b75,
title = "On some extremal problems in graph theory",
abstract = "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).",
author = "P. Erdős",
year = "1965",
month = "6",
doi = "10.1007/BF02760037",
language = "English",
volume = "3",
pages = "113--116",
journal = "Israel Journal of Mathematics",
issn = "0021-2172",
publisher = "Springer New York",
number = "2",

}

TY - JOUR

T1 - On some extremal problems in graph theory

AU - Erdős, P.

PY - 1965/6

Y1 - 1965/6

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=51249166833&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51249166833&partnerID=8YFLogxK

U2 - 10.1007/BF02760037

DO - 10.1007/BF02760037

M3 - Article

VL - 3

SP - 113

EP - 116

JO - Israel Journal of Mathematics

JF - Israel Journal of Mathematics

SN - 0021-2172

IS - 2

ER -