Upper and lower bounds for \(F_v(4,4;5)\)
type: Item
instance of: scholarly article
title: Upper and lower bounds for \(F_v(4,4;5)\)
zbMATH Open document ID: 1204.05060
author: Xiaodong Xu
author: Haipeng Luo
author: Zehui Shao
published in: The Electronic Journal of Combinatorics
publication date: 2010-12-16T00:00:00Z
full work available at URL: v17i1n34.html
review text: Summary: We give a computer assisted proof showing that the unique \((5,3)\)-Ramsey graph is the unique \(K_5\)-free graph of order 13 giving \(_Fv(3,4;5)\leq 13\), then we prove that \(17\leq F_v(2,2,2,4;5)\leq F_v(4,4;5)\leq 23\). This improves the previous best bounds \(16\leq F_v(4,4;5)\leq 25\) provided by Nenov and Kolev.
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 5827380
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5827380