Proceedings - Mathematical Sciences

, Volume 127, Issue 5, pp 779–786 | Cite as

Some infinite families of Ramsey (\({\varvec{P}}_\mathbf{3},{\varvec{P}}_{{\varvec{n}}}\))-minimal trees

  • D RahmadaniEmail author
  • E T Baskoro
  • M Bača
  • H Assiyatun
  • A Semaničová-Feňovčíková


For any given two graphs G and H, the notation \(F\rightarrow \) (GH) means that for any red–blue coloring of all the edges of F will create either a red subgraph isomorphic to G or a blue subgraph isomorphic to H. A graph F is a Ramsey (GH)-minimal graph if \(F\rightarrow \) (GH) but \(F-e\nrightarrow (G,H)\), for every \(e \in E(F)\). The class of all Ramsey (GH)-minimal graphs is denoted by \(\mathcal {R}(G,H)\). In this paper, we construct some infinite families of trees belonging to \(\mathcal {R}(P_3,P_n)\), for \(n=8\) and 9. In particular, we give an algorithm to obtain an infinite family of trees belonging to \(\mathcal {R}(P_3,P_n)\), for \(n\ge 10\).


Ramsey minimal graph coloring Ramsey infinite tree 

2010 Mathematics Subject Classification

Primary: 05C55 Secondary: 05D10 



This research was supported by Research Grants “Program Riset dan Inovasi KK ITB”, “Program Hibah PMDSU ITB-DIKTI”, Ministry of Research, Technology and Higher Education, Indonesia.


  1. 1.
    Burr S A, Erdős P, Faudree R J, Rosseu C C and Schelp R H, Ramsey-minimal graphs for forests, Stud. Sci. Math. Hungar. 15 (1982) 265–273zbMATHGoogle Scholar
  2. 2.
    Diestel R, Graph Theory, 2nd edition (2000) (New York: Springer-Verlag New York Inc.)Google Scholar
  3. 3.
    Faudree R J and Sheehan J, Tree Ramsey-minimal graphs, Congr. Numer. 35 (1982) 295–315MathSciNetzbMATHGoogle Scholar
  4. 4.
    Nešeťril J and Rödl V, Partitions of vertices, Comment. Math. Univ. Carolinae. 17 (1976) 85–95MathSciNetGoogle Scholar
  5. 5.
    Rahmadani D, Baskoro E T and Assiyatun H, On Ramsey Minimal Graphs for the Pair Paths, Proc. Comput. Sci. 74 (2015) 15–20CrossRefGoogle Scholar
  6. 6.
    Yulianti L, Assiyatun H, Uttunggadewa S and Baskoro E T, On Ramsey (\(K_{1,2}, P_4\))-minimal graphs, Far East J. Math. Sci. 40 (2010) 23–36MathSciNetzbMATHGoogle Scholar

Copyright information

© Indian Academy of Sciences 2017

Authors and Affiliations

  • D Rahmadani
    • 1
    Email author
  • E T Baskoro
    • 1
  • M Bača
    • 2
  • H Assiyatun
    • 1
  • A Semaničová-Feňovčíková
    • 2
  1. 1.Combinatorial Mathematics Research Group, Department of Mathematics, Faculty of Mathematics and Natural SciencesInstitut Teknologi Bandung (ITB)BandungIndonesia
  2. 2.Department of Applied Mathematics and InformaticsTechnical UniversityKosiceSlovak Republic

Personalised recommendations