Edge Partition Properties of Graphs
- 1 June 1973
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 25 (3) , 603-610
- https://doi.org/10.4153/cjm-1973-061-1
Abstract
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).Keywords
This publication has 0 references indexed in Scilit: