Edge Folkman numbers
can be viewed as a generalization of more commonly studied Ramsey numbers.
is defined as the smallest
order of any
-free graph
such that any red-blue
coloring of the edges of
contains either a red
or a blue
.
In this note, first we discuss edge Folkman numbers involving graphs
, including
the results
,
, and
.
Our modification of computational methods used previously in the study
of classical Folkman numbers is applied to obtain upper bounds on
for all
.
PDF Access Denied
We have not been able to recognize your IP address
18.97.14.89
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.