A little more about bipartite biregular cages, block designs, and generalized polygons
arXiv:2310.12137
Abstract
In this paper, we obtain new lower and upper bounds for the problem of bipartite biregular cages. Moreover, for girth , we give the exact parameters of the -bipartite biregular cages when using the existence of Steiner System system . For girth and , we use results on -good structures given by ovoids, spreads and sub-polygons in generalized polygons to obtain -bipartite biregular graphs. We emphasize that, as we improve the lower bounds on the order of these graphs, we also prove that some of them are -bipartite biregular cages. In particular, we construct relatively small bipartite biregular graphs from a special class of generalized quadrangles and hexagons. In a special case, we show that the graph obtained is actually a -bipartite biregular cage on vertices.
16 pages