Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8902765 | AKCE International Journal of Graphs and Combinatorics | 2017 | 10 Pages |
Abstract
The extremal number ex(n;{C3,C4}) or simply ex(n;4) denotes the maximal number of edges in a graph on n vertices with forbidden subgraphs C3 and C4. 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=d2+1 for any positive integer dâ 7,57.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Novi H. Bong,