Embedding grids in surfaces

We show that if a very large grid is embedded in a surface, then a large subgrid is embedded in a disc in the surface. This readily implies that: (a) a minor-minimal graph that does not embed in a given surface has no very large grid; and (b) a minor-minimal k-representative embedding in the surface has no very large grid. Similar arguments show (c) that if G is minimal with respect to crossing number, then G has no very large grid. This work is a refinement of Thomassen (J. Combin. Theory Ser. B 70 (1997) 306).

[1]  Bert Gerards,et al.  Branch-Width and Well-Quasi-Ordering in Matroids and Graphs , 2002, J. Comb. Theory, Ser. B.

[2]  Paul D. Seymour,et al.  Graph minors. IV. Tree-width and well-quasi-ordering , 1990, J. Comb. Theory, Ser. B.

[3]  Bojan Mohar,et al.  Generating locally cyclic triangulations of surfaces , 1992, J. Comb. Theory, Ser. B.

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

[5]  Carsten Thomassen.  A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces , 1997, J. Comb. Theory, Ser. B.

[6]  J. W. P. Hirschfeld.  Surveys in combinatorics, 2001 , 2001 .

[7]  Bojan Mohar,et al.  Surveys in Combinatorics, 2001: Graph minors and graphs on surfaces , 2001 .

[8]  Robin Thomas,et al.  A menger-like property of tree-width: The finite case , 1990, J. Comb. Theory, Ser. B.

[9]  Bojan Mohar,et al.  Systems of Curves on Surfaces , 1996, J. Comb. Theory, Ser. B.

[10]  Petr Hlinený,et al.  Crossing-number critical graphs have bounded path-width , 2003, J. Comb. Theory, Ser. B.

[11]  Paul D. Seymour,et al.  Irreducible Triangulations of Surfaces , 1996, Journal of combinatorial theory. Series B (Print).

[12]  Paul D. Seymour,et al.  Graph minors. VIII. A kuratowski theorem for general surfaces , 1990, J. Comb. Theory, Ser. B.

[13]  Carsten Thomassen,et al.  Highly Connected Sets and the Excluded Grid Theorem , 1999, J. Comb. Theory, Ser. B.