Properties of certain families of \(2k\)-cycle-free graphs

DOI10.1006/jctb.1994.1020zbMath0803.05028OpenAlexW2093219044WikidataQ56698341 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

zbMATH Keywords

extremal graphslower boundbipartite graphsgirthmagnitudeextremal sequenceconstantcycle-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (10)

The number of \(C_{2\ell}\)-free graphs ⋮ Unnamed Item ⋮ A new series of dense graphs of high girth ⋮ The Turán number of directed paths and oriented cycles ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ General properties of some families of graphs defined by systems of equations ⋮ Multi-color Ramsey numbers of even cycles ⋮ Polarities and \(2k\)-cycle-free graphs ⋮ A note on the Turán function of even cycles ⋮ Forbidden induced partial orders

This page was built for publication: Properties of certain families of \(2k\)-cycle-free graphs