On the maximum order of graphs embedded in surfaces

The maximum number of vertices in a graph of maximum degree Δ ? 3 and fixed diameter k ? 2 is upper bounded by ( 1 + o ( 1 ) ) ( Δ - 1 ) k . If we restrict our graphs to certain classes, better upper bounds are known. For instance, for the class of trees there is an upper bound of ( 2 + o ( 1 ) ) ( Δ - 1 ) ? k / 2 ? for a fixed k. The main result of this paper is that graphs embedded in surfaces of bounded Euler genus g behave like trees, in the sense that, for large Δ, such graphs have orders bounded from above by { c ( g + 1 ) ( Δ - 1 ) ? k / 2 ? if? k ?is even c ( g 3 / 2 + 1 ) ( Δ - 1 ) ? k / 2 ? if? k ?is odd , where c is an absolute constant. This result represents a qualitative improvement over all previous results, even for planar graphs of odd diameter k. With respect to lower bounds, we construct graphs of Euler genus g, odd diameter k, and order c ( g + 1 ) ( Δ - 1 ) ? k / 2 ? for some absolute constant c 0 . Our results answer in the negative a question of Miller and Siraň (2005).

[1]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[2]  Martin Knor,et al.  Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface , 1997, J. Graph Theory.

[3]  Pat Morin,et al.  Layered Separators in Minor-Closed Families with Applications , 2013 .

[4]  S. A. Tishchenko.  N-separators in planar graphs , 2012, Eur. J. Comb..

[5]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[6]  N. Biggs.  Spanning trees of dual graphs , 1971 .

[7]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[8]  Michael R. Fellows,et al.  Large Planar Graphs with Given Diameter and Maximum Degree , 1995, Discret. Appl. Math..

[9]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[10]  S. A. Tishchenko.  Maximum size of a planar graph with given degree and even diameter , 2012, Eur. J. Comb..

[11]  Martin Knor,et al.  Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface , 1997, J. Graph Theory.

[12]  J. Sirán,et al.  Moore Graphs and Beyond: A survey of the Degree/Diameter Problem , 2013 .

[13]  C. Jordan.  Sur les assemblages de lignes. , 1869 .

[14]  B. Richter,et al.  The cycle space of an embedded graph , 1984, J. Graph Theory.

[15]  Pavol Hell,et al.  Largest planar graphs of diameter two and fixed maximum degree , 1993, Discret. Math..

[16]  J. Siagiová.  A NOTE ON A MOORE BOUND FOR GRAPHS EMBEDDED IN SURFACES , 2004 .

[17]  David R. Wood,et al.  The Degree-Diameter Problem for Sparse Graph Classes , 2013, Electron. J. Comb..

[18]  Ramiro Feria-Purón,et al.  Constructions of Large Graphs on Surfaces , 2013, Graphs Comb..

[19]  Michael R. Fellows,et al.  Constructions of large planar networks with given degree and diameter , 1998, Networks.