New constructions of bipartite graphs on \(m\), \(n\) vertices with many edges and without small cycles

DOI10.1006/jctb.1994.1036zbMath0797.05055OpenAlexW2060200869MaRDI QIDQ1328391

Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar

Publication date: 10 October 1994

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.1036

zbMATH Keywords

upper boundbipartite graphsbiregular graphsmall cyclesconjecture of Erdős

Mathematics Subject Classification ID

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

Related Items (3)

General properties of some families of graphs defined by systems of equations ⋮ Cycles in bipartite graphs and an application in number theory ⋮ Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras

This page was built for publication: New constructions of bipartite graphs on \(m\), \(n\) vertices with many edges and without small cycles