Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T15:20:36.400Z Has data issue: false hasContentIssue false

On Independent Complete Subgraphs in a Graph

Published online by Cambridge University Press:  20 November 2018

J. W. Moon*
Affiliation:
University of Alberta, Edmonton, Alberta
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.

A graph G = G(n, e) consists of a set of n nodes e pairs of which are joined by a single edge; we assume that no edge joins a node to itself. A graph with modes is called a complete -graph if each pair of its nodes is joined by an edge. The graphs belonging to some collection of graphs are independent if no two of them have a node in common. The maximum number of independent complete -graphs contained in a given graph G will be denoted by Ik(G).

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1968