On the homogeneous algebraic graphs of large girth and their applications

Abstract Families of finite graphs of large girth were introduced in classical extremal graph theory. One important theoretical result here is the upper bound on the maximal size of the graph with girth ⩾ 2 d established in Even Circuit Theorem by P. Erdos. We consider some results on such algebraic graphs over any field. The upper bound on the dimension of variety of edges for algebraic graphs of girth ⩾ 2 d is established. Getting the lower bound, we use the family of bipartite graphs D ( n , K ) with n ⩾ 2 over a field K , whose partition sets are two copies of the vector space K n . We consider the problem of constructing homogeneous algebraic graphs with a prescribed girth and formulate some problems motivated by classical extremal graph theory. Finally, we present a very short survey on applications of finite homogeneous algebraic graphs to coding theory and cryptography.

[1]  Jacques Tits,et al.  Sur la trialité et certains groupes qui s’en déduisent , 1959 .

[2]  Harald Niederreiter,et al.  Series on Coding Theory and Cryptology , 2007 .

[3]  M. Simonovits,et al.  Cycles of even length in graphs , 1974 .

[4]  A. Rényii,et al.  ON A PROBLEM OF GRAPH THEORY , 1966 .

[5]  Andris Ambainis,et al.  Dense quantum coding and quantum finite automata , 2002, JACM.

[6]  Felix Lazebnik,et al.  New upper bounds on the order of cages , 1996, Electron. J. Comb..

[7]  Wilfried Imrich,et al.  Explicit construction of regular graphs without small cycles , 1984, Comb..

[8]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[9]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[10]  Robert Michael Tanner,et al.  A transform theory for a class of group-invariant codes , 1988, IEEE Trans. Inf. Theory.

[11]  A. Hora,et al.  Distance-Regular Graphs , 2007 .

[12]  V. Ustimenko,et al.  On Graph-Based Cryptography and Symbolic Computations , 2007, Serdica Journal of Computing.

[13]  L. Beineke,et al.  Selected Topics in Graph Theory 2 , 1985 .

[14]  Doron Zeilberger,et al.  The Number of [Old-Time] Basketball Games with Final Score n:n where the Home Team was Never Losing but also Never Ahead by More Than w Points , 2007, Electron. J. Comb..

[15]  Vasyl Ustimenko,et al.  CRYPTIM: Graphs as Tools for Symmetric Encryption , 2001, AAECC.

[16]  Vasiliy A. Ustimenko,et al.  Graphs with Special Arcs and Cryptography , 2002 .

[17]  Norman Biggs,et al.  The sextet construction for cubic graphs , 1983, Comb..

[18]  F. Lazebnik,et al.  A new series of dense graphs of high girth , 1995, math/9501231.

[19]  Yuliang Zheng,et al.  Public key cryptography : third International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000 : proceedings , 2000 .

[20]  V. A. Ustimenko,et al.  On linguistic dynamical systems, families of graphs of large girth, and cryptography , 2007 .

[21]  N. Biggs.  Algebraic Graph Theory: COLOURING PROBLEMS , 1974 .

[22]  Zoltán Füredi,et al.  Graphs of Prescribed Girth and Bi-Degree , 1995, J. Comb. Theory, Ser. B.

[23]  Miklós Simonovits,et al.  On a class of degenerate extremal graph problems , 1983, Comb..

[24]  Alfred Weiss.  Girths of bipartite sextet graphs , 1984, Comb..

[25]  Brendan D. McKay,et al.  A nine point theorem for 3-connected graphs , 1982, Comb..

[26]  Gilles Van Assche,et al.  Quantum cryptography and secret-key distillation , 2006 .

[27]  H. Sachs.  Regular Graphs with Given Girth and Restricted Circuits , 1963 .

[28]  Vasiliy A. Ustimenko,et al.  Extremal properties of regular and affine generalized m-gons as tactical configurations , 2003, Eur. J. Comb..

[29]  Miklós Simonovits,et al.  Compactness results in extremal graph theory , 1982, Comb..

[30]  Felix Lazebnik,et al.  Some Algebraic Constructions of Dense Graphs of Large Girth and of Large Size , 1992, Expanding Graphs.

[31]  J. Moura,et al.  Structured low-density parity-check codes , 2004, IEEE Signal Processing Magazine.

[32]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[33]  Abderezak Touzene,et al.  Graph based private key crypto-system , 2008 .

[34]  Walter Feit,et al.  The nonexistence of certain generalized polygons , 1964 .

[35]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[36]  Felix Lazebnik,et al.  A characterization of the components of the graphs D(k, q) , 1996, Discret. Math..

[37]  Sidney C. Port,et al.  Infinite particle systems , 1973 .

[38]  J. H. Lodge,et al.  Graph theoretic construction of generalized product codes , 1997, Proceedings of IEEE International Symposium on Information Theory.

[39]  Norman L. Biggs,et al.  Note on the girth of Ramanujan graphs , 1990, J. Comb. Theory, Ser. B.

[40]  V. A. Ustimenko,et al.  On the extremal graph theory for directed graphs and its cryptographical applications , 2007 .