The size of bipartite graphs with girth eight

Details The size of bipartite graphs with girth eight The size of bipartite graphs with girth eight

2001-02-27

arxiv.org/abs/math/0102210v1

Mathematics

Combinatorics

10 pages

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

The size of bipartite graphs with girth eight does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The size of bipartite graphs with girth eight, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The size of bipartite graphs with girth eight will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-563463