Bounds for graphs of given girth and generalized polygons

dc.contributor.author	Benkherouf, Lakdere
dc.contributor.author	Ustimenko, Vasyl
dc.date.accessioned	2015-10-16T08:30:15Z
dc.date.available	2015-10-16T08:30:15Z
dc.date.issued	2002-10-21
dc.identifier.uri	http://hdl.handle.net/123456789/30
dc.description	Abstract. In this paper we present a bound for bipartite graphs with average bidegrees and satisfying the inequality ≥ , ≥ 1. This bound turns out to be the sharpest existing bound. Sizes of known families of finite generalized polygons are exactly on that bound. Finally, we present lower bounds for the numbers of points and lines of biregular graphs (tactical configurations) in terms of their bidegrees. We prove that finite generalized polygons have smallest possible order among tactical configuration of given bidegrees and girth. We also present an upper bound on the size of graphs of girth g ≥ 2t+ 1. This bound has the same magnitude as that of Erd¨os bound, which estimates the size of graphs without cycles C2t.	uk_UA
dc.language.iso	en	uk_UA
dc.title	Bounds for graphs of given girth and generalized polygons	uk_UA
dc.type	Article	uk_UA