Buscar
Mostrando ítems 1-1 de 1
Artículo
Size of graphs with high girth
(Elsevier, 2007)
Let n≥4 be a positive integer and let ex (ν;{C3, . . . , Cn}) denote the maximum number of edges in a {C3, . . . , Cn}-free simple graph of order ν. This paper givesthe exact value of this function for all νup to ⌊(16n−15)/5⌋. ...