Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-20T00:17:57.456Z Has data issue: false hasContentIssue false
  • English
  • Français

Some Extremal Properties of Bipartite Subgraphs

Published online by Cambridge University Press:  20 November 2018

C. S. Edwards
C. S. Edwards*
Affiliation:
University of Birmingham, Birmingham, England
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Gp = (V, X) is a graph on p vertices, with vertex set V and edge set X. Occasionally, to avoid ambiguity, V and X will be written V(GP) and X(GP), respectively.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 25 , Issue 3 , June 1973 , pp. 475 - 485
Copyright
Copyright © Canadian Mathematical Society 1973

References

1. Harary, F., Graph Theory (Addison-Wesley, Reading, 1969).Google Scholar
2. Turan, P., Eine Extremalaufgabe aus der Graphentheorie, Mat. Lapok 48 (1941), 436–452.Google Scholar