Some new upper bounds of ex(n; {C3,C4})

Title: Some new upper bounds of ex(n; {C3,C4})
Creator: Bong, Novi H.
Relation: AKCE International Journal of Graphs and Combinatorics Vol. 14, Issue 3, p. 251-260
Publisher Link: http://dx.doi.org/10.1016/j.akcej.2017.03.006
Publisher: Kalasalingam University
Resource Type: journal article
Date: 2017
Description: The extremal number ex(n;{C₃,C₄}) or simply ex(n;4) denotes the maximal number of edges in a graph on n vertices with forbidden subgraphs C₃ and C₄. The exact number of ex(n;4) is only known for n up to 32 and n=50. There are upper and lower bounds of ex(n;4) for other values of n. In this paper, we improve the upper bound of ex(n;4) for n=33,34,...,42 and also n=d²+1 for any positive integer d≠7,57.
Subject: extremal graph; extremal number; forbidden subgraph; size maximality
Identifier: http://hdl.handle.net/1959.13/1399765
Identifier: uon:34671
Identifier: ISSN:0972-8600
Rights: This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
Language: eng
Full Text
Reviewed

		Thumbnail	File	Description	Size	Format
View Details Download			ATTACHMENT02	Publisher version (open access)	306 KB	Adobe Acrobat PDF	View Details Download