On the characterization of some algebraically defined bipartite graphs of girth eight
Abstract
For any field and polynomials , let denote the bipartite graph with vertex partition , where and are two copies of , and is adjacent to if and only if and . The graph is known to be of girth eight. When is a finite field of odd size or is an algebraically closed field of characteristic zero, the graph is conjectured to be the unique one with girth at least eight among those up to isomorphism. This conjecture has been confirmed for the case that both are monomials over , and for the case that at least one of is a monomial over . If one of is a monomial, it has also been proved the existence of a positive integer such that is isomorphic to provided has girth at least eight. In this paper, these results are shown to be valid when the restriction on the polynomials is relaxed further to that one of them is the product of two univariate polynomials. Furthermore, all of such polynomials are characterized completely.
Keywords
Cite
@article{arxiv.1912.04592,
title = {On the characterization of some algebraically defined bipartite graphs of girth eight},
author = {Ming Xu and Xiaoyan Cheng and Yuansheng Tang},
journal= {arXiv preprint arXiv:1912.04592},
year = {2020}
}