Hostname: page-component-7b7567c8c-m6dxt Total loading time: 0 Render date: 2026-11-19T05:25:07.881Z Has data issue: false hasContentIssue false

The Coarseness of the Complete Graph

Published online by Cambridge University Press:  20 November 2018

Richard K. Guy
Affiliation:
University of Calgary, Alberta, Canada; Purdue University
Lowell W. Beineke
Affiliation:
Fort Wayne, Indiana; University College, London, 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.

The coarseness, c(G), of a graph G is the maximum number of edge-disjoint, non-planar subgraphs of G. We consider only the complete graph, Kp , on p vertices here. For p = 3r, Erdös conjectured that the coarseness was , but it has been shown (1) that

1

where square brackets denote integer part.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1968