On dense bipartite graphs of girth eigth and upper bounds for certain configurations in planar point-line systems
From MaRDI portal
Publication:1352870
DOI10.1006/jcta.1997.2745zbMath0878.05051WikidataQ56850765 ScholiaQ56850765MaRDI QIDQ1352870
László A. Székely, Dominique De Caen
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
Related Items
New bounds on \(\bar{2}\)-separable codes of length 2, The size of bipartite graphs with a given girth, Triangles in arrangements of points and lines in the plane