The Ramsey number \(R(P_n, K_1 + P_m)\) is determined for various ranges of \(n\) and \(m\), where \(P_n\) is a path with \(n\) vertices, and \(K_1 + P_m\) is the graph obtained from a path \(P_m\) by adding an additional vertex that is adjacent to all of the vertices of the path. For example, it is shown that \(R(P_n, K_1 + P_m) = 2n - 1\) for \(n \geq 4\), \(m\) even, and \(4 \leq m \leq n + 1\). This result follows a previous paper of the authors on \(R(P_n, W_m)\), where \(W_m\) is the wheel with \(m + 1\) vertices. On certain intervals bounds are given of which the following is an example. If \(n \geq 6\) and \(m\) is even with \(n + 2 \leq m \leq \lfloor n/3 \rfloor\), then \(m + \lfloor (3n)/2 \rfloor - 2 \geq R(P_n, K_1 + P_m) \geq 2n - 1\). Many small order Ramsey numbers are determined for the pair \((P_n, K_1 + P_m)\).
- scientific article; zbMATH DE number 4162920 (Why is no real title available?)
- scientific article; zbMATH DE number 3262254 (Why is no real title available?)
- On Ramsey numbers for paths versus wheels
- On the path-complete bipartite Ramsey number
- Path-cycle Ramsey numbers
- Path-fan Ramsey numbers
- Path-star Ramsey numbers
- Ramsey Numbers for the Pair Sparse Graph-Path or Cycle
- The Ramsey numbers r(P\(_m\),K\(_n\))
- On path-quasar Ramsey numbers
- An exact formula for all star-kipas Ramsey numbers
- Path-fan Ramsey numbers
- Ramsey numbers of squares of paths
- The ramsey numbers for stripes and one complete graph
- The Ramsey Numbers of Paths Versus Kipases
- On the Ramsey numbers for paths and generalized Jahangir graphs \(J_{s,m}\)
- On Path Convex Ramsey Numbers
- Closing the gap on path-kipas Ramsey numbers
- On the Ramsey-goodness of paths
- Ramsey numbers of long cycles versus books or wheels
This page was built for publication: Path-kipas Ramsey numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383545)
