ON RAMSEY (P3;C5)-MINIMAL GRAPHS

• المؤلف الرئيسي: AHSANUNNISA, MARYAM
• التنسيق: Final Project
• اللغة: Indonesia
• الوصول للمادة أونلاين: https://digilib.itb.ac.id/gdl/view/18886
• المؤسسة: Institut Teknologi Bandung

Let G and H be two given graphs. The notation F !(G;H) means that every red-blue coloring on the edges of F satisfies the following condition: F contains either a red subgraph G or a blue subgraph H. A graph F is a Ramsey (G;H)- minimal graph if F ! (G;H) but F 9 (G;H) for any proper subgraph F o...