Skip to main content
SpringerLink
Log in
Book cover

Latin American Symposium on Theoretical Informatics

LATIN 2002: LATIN 2002: Theoretical Informatics pp 224–235Cite as

k-pseudosnakes in Large Grids

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2286))

Abstract

We study the problem of finding maximum induced subgraphs of bounded maximum degree k-so-called “k-pseudosnakes”- in D-dimensional grids with all side lengths large. We prove several asymptotic upper bounds and give several lower bounds based on constructions. The constructions turn out to be asymptotically optimal for every D when k = 0, 1,D, 2D - 2, 2D - 1 and 2D.

Partially supported by FONDAP on Applied Mathematics, Fondecyt 1990616 (I. R.) and Fondecyt 1010442 (M. M.).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrews, J., Jacobson M.: On a generalization of chromatic number and two kinds of Ramsey numbers. Ars Comb. 23 (1987) 97–102.

    MathSciNet  MATH  Google Scholar 

  2. Abbott, H.L., Dierker, P.F.: Snakes in powers of complete graphs. SIAM J. Appl. Math. 32(2) (1977) 347–355.

    Article  MathSciNet  Google Scholar 

  3. Abbott H.L., Katchalski, M.: Snakes and pseudo-snakes in powers of complete graphs. Discrete Math. 68 (1988) 1–8.

    Article  MathSciNet  Google Scholar 

  4. Abbott H.L., Katchalski, M.: Further results on snakes in powers of complete graphs. Discrete Math. 91 (1991) 111–120.

    Article  MathSciNet  Google Scholar 

  5. Danzer, L., Klee, V.: Lengths of snakes in boxes. J. Comb. Th. 2 (1967) 258–265.

    Article  MathSciNet  Google Scholar 

  6. Deimer, K.: A new upper bound for the length of snakes. Combinatorica 5(2) (1985) 109–120.

    Article  MathSciNet  Google Scholar 

  7. Favaron, O.: k-Domination and k-independence in graphs. Eleventh British Combinatorial Conference (London, 1987). Ars Combin. 25 (1988) C 159–167.

    Google Scholar 

  8. Fink, J., Jacobson, M.: On n-domination, n-dependence and forbidden subgraphs. Graph Theory with Applications to Algorithms and Computer Science, Proceedings 5th Int. Conf., Kalamazoo/MI (1985) 301–311.

    Google Scholar 

  9. McCuaig, W., Shepherd, B.: Domination in graphs with minimum degree two. J. Graph Theory 13 (1989) 749–762.

    Article  MathSciNet  Google Scholar 

  10. Payan, C.: Sur le nombre d’absorption d’un graphe simple. Cah. Centre Etud. Rech. Oper. 17 (1975) 307–317.

    MathSciNet  MATH  Google Scholar 

  11. Snevily, H.S.: The snake-in-the-box problem: A new upper bound. Discrete Math. 133 (1994) 307–314.

    Article  MathSciNet  Google Scholar 

  12. Solov’jeva, F.I.: An upper bound for the length of a cycle in an n-dimensional unit cube. Diskretnyi Analiz 45 (1987).

    Google Scholar 

  13. Wojciechowski, J.: A new lower bound for snake-in-the-box codes. Combinatorica 9(1) (1989) 91–99.

    Article  MathSciNet  Google Scholar 

  14. Zémor, G.: An upper bound on the size of snake-in-the-box. Combinatorica 17(2) (1997) 287–298.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Ingeniería Matemática and Centro de Modelamiento Matemático UMR 2071-CNRS, Universidad de Chile, Santiago, Chile

    Martín Matamala & Ivan Rapaport

  2. University of Maryland University College, Schwäbisch Gmünd, Germany

    Erich Prisner

Authors
  1. Martín Matamala
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Erich Prisner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ivan Rapaport
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Compaq Cambridge Research Laboratory, One Cambridge Center, 02142-1612, Cambridge, MA, USA

    Sergio Rajsbaum

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matamala, M., Prisner, E., Rapaport, I. (2002). k-pseudosnakes in Large Grids. In: Rajsbaum, S. (eds) LATIN 2002: Theoretical Informatics. LATIN 2002. Lecture Notes in Computer Science, vol 2286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45995-2_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-45995-2_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43400-9

  • Online ISBN: 978-3-540-45995-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation