Extremal problems involving vertices and edges on odd cycles

P. Erdős, R. J. Faudree, C. C. Rousseau

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

We investigate the minimum, taken over all graphs G with n vertices and at least ⌊n2/4⌋ + 1 edges, of the number of vertices and edges of G which are on cycles of length 2k + 1.

Original languageEnglish
Pages (from-to)23-31
Number of pages9
JournalDiscrete Mathematics
Volume101
Issue number1-3
DOIs
Publication statusPublished - May 29 1992

Fingerprint

Odd Cycle
Extremal Problems
Cycle
Graph in graph theory

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Extremal problems involving vertices and edges on odd cycles. / Erdős, P.; Faudree, R. J.; Rousseau, C. C.

In: Discrete Mathematics, Vol. 101, No. 1-3, 29.05.1992, p. 23-31.

Research output: Contribution to journalArticle

Erdős, P. ; Faudree, R. J. ; Rousseau, C. C. / Extremal problems involving vertices and edges on odd cycles. In: Discrete Mathematics. 1992 ; Vol. 101, No. 1-3. pp. 23-31.
@article{f6d0c6af23f64e648754677f5f05d813,
title = "Extremal problems involving vertices and edges on odd cycles",
abstract = "We investigate the minimum, taken over all graphs G with n vertices and at least ⌊n2/4⌋ + 1 edges, of the number of vertices and edges of G which are on cycles of length 2k + 1.",
author = "P. Erdős and Faudree, {R. J.} and Rousseau, {C. C.}",
year = "1992",
month = "5",
day = "29",
doi = "10.1016/0012-365X(92)90586-5",
language = "English",
volume = "101",
pages = "23--31",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Extremal problems involving vertices and edges on odd cycles

AU - Erdős, P.

AU - Faudree, R. J.

AU - Rousseau, C. C.

PY - 1992/5/29

Y1 - 1992/5/29

N2 - We investigate the minimum, taken over all graphs G with n vertices and at least ⌊n2/4⌋ + 1 edges, of the number of vertices and edges of G which are on cycles of length 2k + 1.

AB - We investigate the minimum, taken over all graphs G with n vertices and at least ⌊n2/4⌋ + 1 edges, of the number of vertices and edges of G which are on cycles of length 2k + 1.

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

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

U2 - 10.1016/0012-365X(92)90586-5

DO - 10.1016/0012-365X(92)90586-5

M3 - Article

VL - 101

SP - 23

EP - 31

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -