Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
From MaRDI portal
Publication:1179469
DOI10.1016/0095-8956(91)90097-4zbMath0755.05060MaRDI QIDQ1179469
Publication date: 26 June 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(91)90097-4
05C35: Extremal problems in graph theory
Related Items
A new series of dense graphs of high girth, Polarities and \(2k\)-cycle-free graphs, Explicit construction of graphs with an arbitrary large girth and of large size, Some structural properties of low-rank matrices related to computational complexity
Cites Work