Bell Laboratories, Madison, N.J., USA;Lockheed Missiles & Space Co., Sunnyvale, Calif., USA;Western Michigan University, Kalamazoo, Mich. 49001, USA
Abstract:
For a graph G, the Ramsey number r(G) is the smallest natural number p such that given a graph H with p points. H or H? contains a G. An (n,j)-linear forest L is the disjoint union of nontrivial paths, j of which have an odd number of points, and such that the union has n points. If L is an (n,j)-linear forest, then we show that .
