Properties of certain families of \(2k\)-cycle-free graphs
From MaRDI portal
Publication:1322024
DOI10.1006/jctb.1994.1020zbMath0803.05028WikidataQ56698341 ScholiaQ56698341MaRDI QIDQ1322024
Vasiliy A. Ustimenko, Andrew J. Woldar, Felix Lazebnik
Publication date: 2 January 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1994.1020
extremal graphs; lower bound; bipartite graphs; girth; magnitude; extremal sequence; constant; cycle-free graphs
Related Items
A new series of dense graphs of high girth, Unnamed Item, The number of \(C_{2\ell}\)-free graphs, Polarities and \(2k\)-cycle-free graphs, Forbidden induced partial orders, Multi-color Ramsey numbers of even cycles, The Turán number of directed paths and oriented cycles, General properties of some families of graphs defined by systems of equations, A note on the Turán function of even cycles, Embedding Graphs into Larger Graphs: Results, Methods, and Problems