General properties of some families of graphs defined by systems of equations

In this paper we present a simple method for constructing infinite families of graphs defined by a class of systems of equations over commutative rings. We show that the graphs in all such families possess some general properties including regularity and bi-regularity, existence of special vertex colorings, and existence of covering maps — hence, embedded spectra — between every two members of the same family. Another general property, recently discovered, is that nearly every graph constructed in this manner edge-decomposes either the complete, or complete bipartite, graph which it spans. In many instances, specializations of these constructions have proved useful in various graph theory problems, but especially in many extremal problems. A short survey of the related results is included. We also show that the edgedecomposition property allows one to improve existing lower bounds for some multicolor Ramsey numbers.

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

[2]  Felix Lazebnik,et al.  New Lower Bounds on the Multicolor Ramsey Numbers rk(C4) , 2000, J. Comb. Theory, Ser. B.

[3]  D. Cvetkovic,et al.  Spectra of graphs : theory and application , 1995 .

[4]  Zoltán Füredi,et al.  Graphs without quadrilaterals , 1983, J. Comb. Theory, Ser. B.

[5]  F. Lazebnik,et al.  NEW LOWER BOUNDS ON THE MULTICOLOR RAMSEY NUMBERS r k ( C 4 ) , 2003 .

[6]  C. T. Benson.  Minimal Regular Graphs of Girths Eight and Twelve , 1966, Canadian Journal of Mathematics.

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

[8]  N. Jacobson,et al.  Basic Algebra I , 1976 .

[9]  Paul Erdös,et al.  Some old and new problems in various branches of combinatorics , 1997, Discret. Math..

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

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

[12]  Felix Lazebnik,et al.  New Constructions of Bipartite Graphs on m, n Vertices with Many Edges and Without Small Cycles , 1994, J. Comb. Theory, Ser. B.

[13]  Zsolt Tuza,et al.  Decompositions of regular bipartite graphs , 1991, Discret. Math..

[14]  A. Schwenk.  COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A GRAPH. , 1974 .

[15]  H. Sachs,et al.  Regukre Graphen gegebener Taillenweite mit minimaler Knotenzahl , 1963 .

[16]  Felix Lazebnik,et al.  Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size , 1995, Discret. Appl. Math..

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

[18]  Felix Lazebnik,et al.  New Examples of Graphs without Small Cycles and of Large Size , 1993, Eur. J. Comb..

[19]  Ronald L. Graham,et al.  On Multicolor Ramsey Numbers for Complete Bipartite Graphs , 1975 .

[20]  A. Lubotzky,et al.  Ramanujan graphs , 2017, Comb..

[21]  W. G. Brown.  On Graphs that do not Contain a Thomsen Graph , 1966, Canadian Mathematical Bulletin.

[22]  V. A. Ustimenko,et al.  On Some Properties of Geometries of Chevalley Groups and Their Generalizations , 1994 .

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

[24]  Lynn Batten.  Combinatorics of Finite Geometries , 1986 .

[25]  Zoltán Füredi,et al.  On the Number of Edges of Quadrilateral-Free Graphs , 1996, J. Comb. Theory, Ser. B.

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

[27]  E. Szemerédi,et al.  On a problem of graph theory , 1967 .

[28]  Felix Lazebnik,et al.  Properties of Certain Families of 2k-Cycle-Free Graphs , 1994, J. Comb. Theory, Ser. B.

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

[30]  Felix Lazebnik,et al.  On the structure of extremal graphs of high girth , 1997 .

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