✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
In this paper, we found the Ramsey numbers for the graph class of edgeless graphs, complete graphs, star graphs and class of all edgeless and complete graphs.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:For any graph class G of any two positive integers i and j, the Ramsey number RG(i, j) is the smallest integer such that every graph in G on atleast RG(i, j) vertices has a clique of size i or an independent set of size j.
📊
Key Findings & Data:For any graph class G of any two positive integers i and j, the Ramsey number RG(i, j) is the smallest integer such that every graph in G on atleast RG(i, j) vertices has a clique of size i or an independent set of size j.
💡
Conclusion & Impact:In this paper, we found the Ramsey numbers for the graph class of edgeless graphs, complete graphs, star graphs and class of all edgeless and complete graphs.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters
Özet
For any graph class G of any two positive integers i and j, the Ramsey number RG(i, j) is the smallest integer such that every graph in G on atleast RG(i, j) vertices has a clique of size i or an independent set of size j. In this paper, we found the Ramsey numbers for the graph class of edgeless graphs, complete graphs, star graphs and class of all edgeless and complete graphs.
🔖
Cite This Article
K., K., H., N. K. (2019). RAMSEY NUMBERS FOR CLASS OF EDGELESS, COMPLETE AND STAR GRAPHS. TWMS (Turkic World Mathematical Society) Journal of Applied and Engineering Mathematics, Cilt: 9 - Sayı: 2, 220–224. https://ajindex.com/articles/327623