On dense bipartite graphs of girth eigth and upper bounds for certain configurations in planar point-line systems

DOI10.1006/jcta.1997.2745zbMath0878.05051OpenAlexW2022587973WikidataQ56850765 ScholiaQ56850765MaRDI QIDQ1352870

Dominique De Caen, László A. Székely

Publication date: 8 April 1997

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1997.2745

zbMATH Keywords

bipartite graphgirthedge densitypoint-line incident graph

Mathematics Subject Classification ID

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

Related Items (3)

The size of bipartite graphs with a given girth ⋮ Triangles in arrangements of points and lines in the plane ⋮ New bounds on \(\bar{2}\)-separable codes of length 2

This page was built for publication: On dense bipartite graphs of girth eigth and upper bounds for certain configurations in planar point-line systems