Computing the Ramsey Number $R(K_5-P_3,K_5)$

Details Computing the Ramsey Number $R(K_5-P_3,K_5)$ Computing the Ramsey Number $R(K_5-P_3,K_5)$

2012-03-29

arxiv.org/abs/1203.6536v1

Mathematics

Combinatorics

Scientific paper

We give a computer-assisted proof of the fact that $R(K_5-P_3, K_5)=25$. This solves one of the three remaining open cases in Hendry's table, which listed the Ramsey numbers for pairs of graphs on 5 vertices. We find that there exist no $(K_5-P_3,K_5)$-good graphs containing a $K_4$ on 23 or 24 vertices, where a graph $F$ is $(G,H)$-good if $F$ does not contain $G$ and the complement of $F$ does not contain $H$. The unique $(K_5-P_3,K_5)$-good graph containing a $K_4$ on 22 vertices is presented.

Affiliated with

Also associated with

No associations

Rating

Computing the Ramsey Number $R(K_5-P_3,K_5)$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing the Ramsey Number $R(K_5-P_3,K_5)$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the Ramsey Number $R(K_5-P_3,K_5)$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57831