AI helps you reading Science

AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically


pub
Go Generating

AI Traceability

AI parses the academic lineage of this thesis


Master Reading Tree
Generate MRT

AI Insight

AI extracts a summary of this paper


Weibo:
Let Pn be a path with n vertices and let Wm be a wheel of m + 1 vertices; namely, a graph consists of a cycle Cm with one additional vertex being adjacent to all vertices of Cm

The Ramsey number of paths with respect to wheels

Discrete Mathematics, no. 3 (2005): 275-277

Cited: 15|Views13
EI

Abstract

For graphs G and H, the Ramsey numberR(G,H) is the smallest positive integer n such that every graph F of order n contains G or the complement of F contains H. For the path P\"n and the wheel W\"m, it is proved that R(P\"n,W\"m)=2n-1 if m is even, m=4, and n=(m/2)(m-2), and R(P\"n,W\"m)=3n-2 if m is odd, m=5, and n=(m-1/2)(m-3).

Code:

Data:

Introduction
  • Let Pn be a path with n vertices and let Wm be a wheel of m + 1 vertices; namely, a graph consists of a cycle Cm with one additional vertex being adjacent to all vertices of Cm. The authors determine the following values for R(Pn, Wm).
  • E-mail addresses: ebaskoro@dns.math.itb.ac.id (E.T. Baskoro), caksurahmat@yahoo.com (Surahmat).
  • E.T. Baskoro, Surahmat / Discrete Mathematics 294 (2005) 275 – 277
  • To prove R(Pn, Wm) 2n − 1 or 3n − 2 for m even or odd, respectively, the authors observe that no Pn is in the graph 2Kn−1 or 3Kn−1 and no Wm is in their complements, respectively.
Highlights
  • For graphs G and H the Ramsey number R(G, H ) is defined as the smallest n such that every graph F of order |F | = n contains G or its complement, F, contains H .

    Let Pn be a path with n vertices and let Wm be a wheel of m + 1 vertices; namely, a graph consists of a cycle Cm with one additional vertex being adjacent to all vertices of Cm
  • R(Pn, Wm) 2n−1, if m is even: Let F be a graph of 2n−1 vertices and F contains no path
  • For i = 1, 2, 3, . . . , (m − 4)/2 define couples Ai in path L1 are as follows: Ai =
  • If L1 is the longest path in F and its endpoints are l11 and l1k, zl11, zl1k ∈/ E(F ) for any z ∈ V1 where V1 = V (F )\V (L1)
  • F contains a wheel Wm formed by l11 and Wm−1 since l11 is not adjacent to any vertex in V1
Results
  • R(Pn, Wm) 2n−1, if m is even: Let F be a graph of 2n−1 vertices and F contains no path
  • L1k−1, l1k) be the longest path in F.
  • L2t−1, l2t ) be the longest path in F [V1].
  • Since |V (F )|=2n−1, there exists at least one vertex w ∈ V2 which is not adjacent to all endpoints l11, l1k, l21, l2t .
  • M/2 let Li be the longest path in F [Vi−1], where Vi−1 =V (F )\
  • Vertex w and all these endpoints form a wheel Wm in F .
  • (m − 4)/2 define couples Ai in path L1 are as follows: Ai =
  • Define couples Bi in path L2 are as follows: Bi =
  • Since L1 is the longest path in F, there will exist one vertex of Ai for each i, say ai, which is not adjacent to w.
  • Since L2 is the longest path in F \V (L1) there must be one vertex, say bi, in couple Bi which is not adjacent to w for each i.
  • Since L1 is the longest path in F.
Conclusion
  • Let F be a graph of 3n − 2 vertices.
  • Assume F contains no path Pn. If L1 is the longest path in F and its endpoints are l11 and l1k, zl11, zl1k ∈/ E(F ) for any z ∈ V1 where V1 = V (F )\V (L1).
  • Since |V1| 2n − 1, n (m − 1/2)((m − 1) − 2) and by the result for the case of m even, the complement of the subgraph F [V1] must contain a wheel Wm−1.
  • F contains a wheel Wm formed by l11 and Wm−1 since l11 is not adjacent to any vertex in V1.
Study subjects and analysis
cases: 3
Since |V (F )|=2n−1, there exists at least one vertex w ∈ V2 which is not adjacent to all endpoints l11, l1k, l21, l2t. We distinguish three cases. Case 1: k < m − 2

Reference
  • E.T. Baskoro, The Ramsey number of paths and small wheels, J. Indones. Math. Soc. (MIHMI) 8 (1) (2002) 13–16.
    Google ScholarLocate open access versionFindings
  • S.A. Burr, P. Erdös, Generalization of a Ramsey-theoretic result of Chvátal, J. Graph Theory 7 (1983) 39–51.
    Google ScholarLocate open access versionFindings
  • V. Chvátal, F. Harary, Generalized Ramsey theory for graphs, III. Small off-diagonal numbers, Pacific J. Math. 41 (1972) 335–345.
    Google ScholarLocate open access versionFindings
  • S.P. Radziszowski, Small Ramsey numbers, Electron. J. Combin. (2002) DS1.9.
    Google ScholarLocate open access versionFindings
  • Surahmat, E.T. Baskoro, On the Ramsey number of a path or a star versus W4 or W5, Proceedings of the 12th Australasian Workshop on Combinatorial Algorithms, Bandung, Indonesia, 14–17 July 2001, pp. 174–179.
    Google ScholarLocate open access versionFindings
  • H.L. Zhou, The Ramsey number of an odd cycles with respect to a wheel, J. Math. Shuxu Zazhi (Wuhan) 15 (1995) 119–120 (in Chinese).
    Google ScholarLocate open access versionFindings
0
Your rating :

No Ratings

Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn