Infinite Family of Ramsey (K1,2,C4)-minimal Graphs

F. F. Hadiputra, D. R. Silaban

Research output: Contribution to journalConference articlepeer-review

2 Citations (Scopus)


Suppose F, G, and H be simple graphs. We let F → (G, H) denote red-blue coloring of edges of F containing either red G or blue H. The graph F is considered Ramsey (G, H)-minimal if F → (G, H) and F − e 6→ (G, H) for arbitrary edge e of E(F). The set of (G, H)-minimal graphs is denoted by R(G, H). In this paper, we study an infinite family of graphs belongs to R(K1,2, C4).

Original languageEnglish
Article number012049
JournalJournal of Physics: Conference Series
Issue number1
Publication statusPublished - 7 Jan 2021
Event10th International Conference and Workshop on High Dimensional Data Analysis, ICW-HDDA 2020 - Sanur-Bali, Indonesia
Duration: 12 Oct 202015 Oct 2020


  • Cycle graph C
  • Edge coloring
  • Path graph K
  • Ramsey minimal graph

Cite this