The size of bipartite graphs with girth eight

Simple item page
dc.creatorNeuwirth, Stefan
dc.date2001-02-27
dc.date.accessioned2026-07-07T04:40:23Z
dc.date.available2026-07-07T04:40:23Z
dc.descriptionReiman produced a quadratic inequality for the size of bipartite graphs of girth six. We get its counterpart for girth eight, a cubic inequality. It is optimal in as far as it admits the algebraic structure of generalized quadrangles as case of equality. This enables us to obtain the optimal estimate e ~ v^(4/3) for balanced bipartite graphs. We also get an optimal estimate for very unbalanced graphs.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/math/0102210
dc.identifierhttp://arxiv.org/abs/math/0102210
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61012
dc.subjectCombinatorics
dc.subject05C35
dc.titleThe size of bipartite graphs with girth eight
dc.typetext

Files

Collections

arXiv