On new results on extremal graph theory, theory of algebraic graphs, and their applications
A family of bipartite homogeneous algebraic graphs of large girth over K is introduced formed by graphs with sets of points and lines isomorphic to Kn, n > 1, and cycle indicator ≥ 2n + 2 such that their projective limit is well defined and isomorph to an infinite forest.
Abstract
New explicit constructions of infinite families of finite small world graphs of large girth with well-defined projective limits which is an infinite tree are described. The applications of these objects to constructions of LDPC codes and cryptographic algorithms are shortly observed. We define families of homogeneous algebraic graphs of large girth over the commutative ring K. For each commutative integrity ring K with |K| > 2, we introduce a family of bipartite homogeneous algebraic graphs of large girth over K formed by graphs with sets of points and lines isomorphic to Kn, n > 1, and cycle indicator ≥ 2n + 2 such that their projective limit is well defined and isomorphic to an infinite forest.