G. Araujo-Pardo, R. Jajcay, Alejandra Ramos-Rivera, T. Szonyi
{"title":"On a relation between bipartite biregular cages, block designs and generalized polygons","authors":"G. Araujo-Pardo, R. Jajcay, Alejandra Ramos-Rivera, T. Szonyi","doi":"10.1002/jcd.21836","DOIUrl":null,"url":null,"abstract":"A bipartite biregular (m,n;g) $(m,n;g)$ ‐graph Γ ${\\rm{\\Gamma }}$ is a bipartite graph of even girth g $g$ having the degree set {m,n} $\\{m,n\\}$ and satisfying the additional property that the vertices in the same partite set have the same degree. An (m,n;g) $(m,n;g)$ ‐bipartite biregular cage is a bipartite biregular (m,n;g) $(m,n;g)$ ‐graph of minimum order. In their 2019 paper, Filipovski, Ramos‐Rivera, and Jajcay present lower bounds on the orders of bipartite biregular (m,n;g) $(m,n;g)$ ‐graphs, and call the graphs that attain these bounds bipartite biregular Moore cages. In our paper, we improve the lower bounds obtained in the above paper. Furthermore, in parallel with the well‐known classical results relating the existence of k $k$ ‐regular Moore graphs of even girths g=6,8 $g=6,8$ , and 12 to the existence of projective planes, generalized quadrangles, and generalized hexagons, we prove that the existence of an S(2,k,v) $S(2,k,v)$ ‐Steiner system yields the existence of a bipartite biregular k,v−1k−1;6 $\\left(k,\\frac{v-1}{k-1};6\\right)$ ‐cage, and, vice versa, the existence of a bipartite biregular (k,n;6) $(k,n;6)$ ‐cage whose order is equal to one of our lower bounds yields the existence of an S(2,k,1+n(k−1)) $S(2,k,1+n(k-1))$ ‐Steiner system. Moreover, with regard to the special case of Steiner triple systems, we completely solve the problem of determining the orders of (3,n;6) $(3,n;6)$ ‐bipartite biregular cages for all integers n≥4 $n\\ge 4$ . Considering girths higher than 6, we relate the existence of generalized polygons (quadrangles, hexagons, and octagons) to the existence of (n+1,n2+1;8) $(n+1,{n}^{2}+1;8)$ ‐, (n2+1,n3+1;8) $({n}^{2}+1,{n}^{3}+1;8)$ ‐, (n,n+2;8) $(n,n+2;8)$ ‐, (n+1,n3+1;12) $(n+1,{n}^{3}+1;12)$ ‐ and (n+1,n2+1;16) $(n+1,{n}^{2}+1;16)$ ‐bipartite biregular cages, respectively. Using this connection, we also derive improved upper bounds for the orders of other classes of bipartite biregular cages of girths 8, 12, and 14.","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"6 1","pages":"479 - 496"},"PeriodicalIF":0.5000,"publicationDate":"2022-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Designs","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1002/jcd.21836","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1
Abstract
A bipartite biregular (m,n;g) $(m,n;g)$ ‐graph Γ ${\rm{\Gamma }}$ is a bipartite graph of even girth g $g$ having the degree set {m,n} $\{m,n\}$ and satisfying the additional property that the vertices in the same partite set have the same degree. An (m,n;g) $(m,n;g)$ ‐bipartite biregular cage is a bipartite biregular (m,n;g) $(m,n;g)$ ‐graph of minimum order. In their 2019 paper, Filipovski, Ramos‐Rivera, and Jajcay present lower bounds on the orders of bipartite biregular (m,n;g) $(m,n;g)$ ‐graphs, and call the graphs that attain these bounds bipartite biregular Moore cages. In our paper, we improve the lower bounds obtained in the above paper. Furthermore, in parallel with the well‐known classical results relating the existence of k $k$ ‐regular Moore graphs of even girths g=6,8 $g=6,8$ , and 12 to the existence of projective planes, generalized quadrangles, and generalized hexagons, we prove that the existence of an S(2,k,v) $S(2,k,v)$ ‐Steiner system yields the existence of a bipartite biregular k,v−1k−1;6 $\left(k,\frac{v-1}{k-1};6\right)$ ‐cage, and, vice versa, the existence of a bipartite biregular (k,n;6) $(k,n;6)$ ‐cage whose order is equal to one of our lower bounds yields the existence of an S(2,k,1+n(k−1)) $S(2,k,1+n(k-1))$ ‐Steiner system. Moreover, with regard to the special case of Steiner triple systems, we completely solve the problem of determining the orders of (3,n;6) $(3,n;6)$ ‐bipartite biregular cages for all integers n≥4 $n\ge 4$ . Considering girths higher than 6, we relate the existence of generalized polygons (quadrangles, hexagons, and octagons) to the existence of (n+1,n2+1;8) $(n+1,{n}^{2}+1;8)$ ‐, (n2+1,n3+1;8) $({n}^{2}+1,{n}^{3}+1;8)$ ‐, (n,n+2;8) $(n,n+2;8)$ ‐, (n+1,n3+1;12) $(n+1,{n}^{3}+1;12)$ ‐ and (n+1,n2+1;16) $(n+1,{n}^{2}+1;16)$ ‐bipartite biregular cages, respectively. Using this connection, we also derive improved upper bounds for the orders of other classes of bipartite biregular cages of girths 8, 12, and 14.
期刊介绍:
The Journal of Combinatorial Designs is an international journal devoted to the timely publication of the most influential papers in the area of combinatorial design theory. All topics in design theory, and in which design theory has important applications, are covered, including:
block designs, t-designs, pairwise balanced designs and group divisible designs
Latin squares, quasigroups, and related algebras
computational methods in design theory
construction methods
applications in computer science, experimental design theory, and coding theory
graph decompositions, factorizations, and design-theoretic techniques in graph theory and extremal combinatorics
finite geometry and its relation with design theory.
algebraic aspects of design theory.
Researchers and scientists can depend on the Journal of Combinatorial Designs for the most recent developments in this rapidly growing field, and to provide a forum for both theoretical research and applications. All papers appearing in the Journal of Combinatorial Designs are carefully peer refereed.