Premium
On ramsey numbers of forests versus nearly complete graphs
Author(s) -
Chartrand Gary,
Gould Ronald J.,
Polimeni Albert D.
Publication year - 1980
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190040211
Subject(s) - combinatorics , mathematics , ramsey's theorem , clique , graph , order (exchange) , clique number , tree (set theory) , discrete mathematics , finance , economics
A formula is presented for the ramsey number of any forest of order at least 3 versus any graph G of order n ≥ 4 having clique number n ‐ 1. In particular, if T is a tree of order m ≥ 3, then r(T, G) = 1 + ( m ‐ 1)( n ‐ 2).
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom