# A New Upper Bound for the Ramsey Number of Fans

@inproceedings{Dvovrak2021ANU, title={A New Upper Bound for the Ramsey Number of Fans}, author={Vojtvech Dvovr'ak and Harry Metrebian}, year={2021} }

A fan Fn is a graph consisting of n triangles, all having precisely one common vertex. Currently, the best known bounds for the Ramsey number R(Fn) are 9n/2 − 5 ≤ R(Fn) ≤ 11n/2 + 6, obtained by Chen, Yu and Zhao. We improve the upper bound to 31n/6 +O(1).

#### References

SHOWING 1-7 OF 7 REFERENCES

On ramsey numbers for books

- Mathematics, Computer Science
- J. Graph Theory
- 1978

This work poses the problem of determining the Ramsey numbers r(Bm, Bn) and demonstrates that in many cases critical colorings are avialable from known examples of strongly regular graphs. Expand

On Ramsey numbers of fans

- Computer Science, Mathematics
- Discret. Appl. Math.
- 2009

It is shown that r ( F 2 , F n ) = 4 n + 1 for n ≥ 2 , and r( F s, F n) ≤4 n + 2 s for n ≤ s ≥ 2 . Expand

Improved bounds on the Ramsey number of fans

- Computer Science, Mathematics
- Eur. J. Comb.
- 2021

It is shown that ${9n/{2}-5\le r(F_n)\le {11n}/ {2} + 6$ for any $n$, which improves previous best bounds. Expand

Ramsey goodness and generalized stars

- Computer Science, Mathematics
- Eur. J. Comb.
- 2010

Let G and H be fixed graphs with s(G)=s (the minimum number of vertices in a color class over all proper vertex-colorings of G with @g(G) colors). It is shown that r(K"1+G,K"1+nH)@?k(hn+s-1)+1 for… Expand

Ramsey theorems for multiple copies of graphs

- Mathematics
- 1975

If G and H are graphs, define the Ramsey number r(G, H) to be the least number p such that if the edges of the complete graph Kp are colored red and blue (say), either the red graph contains G as a… Expand

A NOTE ON RAMSEY NUMBERS FOR FANS

- Mathematics
- Bulletin of the Australian Mathematical Society
- 2015

For two given graphs $G_{1}$ and $G_{2}$, the Ramsey number $R(G_{1},G_{2})$ is the smallest integer $N$ such that, for any graph $G$ of order $N$, either $G$ contains $G_{1}$ as a subgraph or the… Expand