An extremal problem for paths in bipartite graphs

A. Gyárfás, C. C. Rousseau, R. H. Schelp

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

A formula is found for the maximum number of edges in a graph G ⊆ K(a, b) which contains no path P2l for l > c. A similar formula is found for the maximum number of edges in G ⊆ K(a, b) containing no P2l + 1 for l > c. In addition, all extremal graphs are determined.

Original languageEnglish
Pages (from-to)83-95
Number of pages13
JournalJournal of Graph Theory
Volume8
Issue number1
DOIs
Publication statusPublished - Jan 1 1984

    Fingerprint

ASJC Scopus subject areas

  • Geometry and Topology

Cite this