Embedding grids in surfaces Article

•  
• Overview
•  
• Identity
•  
• Additional Document Info
•  
• View All
•  

Overview

abstract

• 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). © 2004 Elsevier Ltd. All rights reserved.

authors

• Bruce Richter R.
• Geelen J.F.
• Salazar Anaya Gelasio

publication date

• 2004-01-01

funding provided via

• Consejo Nacional de Ciencia y Tecnología, CONACYT  Grant
• Natural Sciences and Engineering Research Council of Canada, NSERC  Grant

published in

• European Journal of Combinatorics  Journal

Identity

Digital Object Identifier (DOI)

• 10.1016/j.ejc.2003.07.007

Additional Document Info

start page

• 785

end page

• 792

volume

• 25

issue

• 6