On Ramsey (3K 2, K 3) – minimal graphs

The Ramsey graph theory has many interesting applications, such as in the fields of communications, information retrieval, and decision making. One of growing topics in Ramsey theory is Ramsey minimal graph. For any given graphs G and H, find graphs F such that any red-blue coloring of all edges of...

Full description

Saved in:
Bibliographic Details
Main Authors: Wijaya, Kristiana, Baskoro, Edy Tri, Assiyatun, Hilda, Suprijanto, Djoko
Format: Conference Proceeding
Language:English
Subjects:
Coloring
Decision making
Decision theory
Graph theory
Graphs
Information retrieval
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Ramsey graph theory has many interesting applications, such as in the fields of communications, information retrieval, and decision making. One of growing topics in Ramsey theory is Ramsey minimal graph. For any given graphs G and H, find graphs F such that any red-blue coloring of all edges of F contains either a red copy of G or a blue copy of H. If this condition is not satisfied by the graph F − e, then we call the graph F as a Ramsey (G, H) – minimal. In this paper, we derive the properties of (3K 2, K 3) – minimal graphs. We, then, characterize all Ramsey (3K 2, K 3) – minimal graphs.
ISSN:0094-243X
1551-7616
DOI:10.1063/1.4940826