Hostname: page-component-7b7567c8c-m6dxt Total loading time: 0 Render date: 2026-11-18T14:51:56.888Z Has data issue: false hasContentIssue false

Edge Partition Properties of Graphs

Published online by Cambridge University Press:  20 November 2018

C. Ward Henson*
Affiliation:
Duke University, Durham, North Carolina
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.

Erdös and Hajnal [1] have introduced an edge partition relation for graphs

(1)

which means that whenever the edges of G are separated into two sets, E1 and E2, there exists a subgraph G’ of G such that G’ is isomorphic to Hi and the edges of G’ are all in Ei. for i = 1 or 2. A class of graphs has the G-R (Galvin-Ramsey) property [2] if for each H in there exists a G in which satisfies G→(H,H).

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1973