Paper Info
Title
Extremal graphs with no C4's, C6's, or C10's
Abstract
We present a new construction for arbitrarily large graphs with n vertices, (n2)32 edges and no C4, (n2)43 edges and no C6, and (n2)65 edges and no C10.
Year
DOI
Venue
1991
10.1016/0095-8956(91)90097-4
Journal of Combinatorial Theory, Series B
DocType
Volume
Issue
Journal
52
1
ISSN
Citations 
PageRank 
0095-8956
14
1.29
References 
Authors
0
1
Name
Order
Citations
PageRank
Rephael Wenger144143.54