Skip to main content
SpringerLink
Log in

Pebbling in Kneser Graphs

  • Conference paper
  • First Online:
LATIN 2024: Theoretical Informatics (LATIN 2024)

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

Included in the following conference series:

  • 68 Accesses

Abstract

Graph pebbling is a game played on graphs with pebbles on their vertices. A pebbling move removes two pebbles from one vertex and places one pebble on an adjacent vertex. The pebbling number \(\pi (G)\) is the smallest t so that from any initial configuration of t pebbles it is possible, after a sequence of pebbling moves, to place a pebble on any given target vertex. We consider the pebbling number of Kneser graphs, and give positive evidence for the conjecture that every Kneser graph has pebbling number equal to its number of vertices.

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

Access this chapter

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 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.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

Institutional subscriptions

References

  1. Adauto, M., Cruz, M., Figueiredo, C., Hurlbert, G., Sasaki, D.: On the pebbling numbers of some snarks. arXiv:2303.13292 [math.CO] (2023)

  2. Alcón, L., Gutierrez, M., Hurlbert, G.: Pebbling in split graphs. SIAM J. Discret. Math. 28(3), 1449–1466 (2014)

    Article  MathSciNet  Google Scholar 

  3. Alcón, L., Gutierrez, M., Hurlbert, G.: Pebbling in semi-2-trees. Discret. Math. 340(7), 1467–1480 (2017)

    Article  MathSciNet  Google Scholar 

  4. Alcón, L., Hurlbert, G.: Pebbling in powers of paths. Discret. Math. 346(5), 113315 ( 20 p.) (2023)

    Google Scholar 

  5. Chan, M., Godbole, A.P.: Improved pebbling bounds. Discret. Math. 308(11), 2301–2306 (2008)

    Article  MathSciNet  Google Scholar 

  6. Chung, F.R.K.: Pebbling in hypercubes. SIAM J. Discret. Math. 2(4), 467–472 (1989)

    Article  MathSciNet  Google Scholar 

  7. Clarke, T., Hochberg, R., Hurlbert, G.: Pebbling in diameter two graphs and products of paths. J. Graph Theor. 25(2), 119–128 (1997)

    Article  MathSciNet  Google Scholar 

  8. Cranston, D.W., Postle, L., Xue, C., Yerger, C.: Modified linear programming and class 0 bounds for graph pebbling. J. Combin. Optim. 34(1), 114–132 (2017)

    Article  MathSciNet  Google Scholar 

  9. Czygrinow, A., Hurlbert, G., Kierstead, H., Trotter, W.: A note on graph pebbling. Graphs Combin. 18(2), 219–225 (2002)

    Article  MathSciNet  Google Scholar 

  10. Hurlbert, G.: A survey of graph pebbling. Congr. Numer. 139, 41–64 (1999)

    MathSciNet  Google Scholar 

  11. Hurlbert, G.: Recent progress in graph pebbling. Graph Theor. Notes N.Y. 49, 25–37 (2005)

    MathSciNet  Google Scholar 

  12. Hurlbert, G.: The weight function lemma for graph pebbling. J. Combin. Optim. 34(2), 343–361 (2017)

    Article  MathSciNet  Google Scholar 

  13. Lovász, L.: Combinatorial Problems and Exercises. North Holland, Amsterdam, New York, Oxford (1979)

    Google Scholar 

  14. Pachter, L., Snevily, H., Voxman, B.: On pebbling graphs. Congr. Numer. 107, 65–80 (1995)

    MathSciNet  Google Scholar 

  15. Valencia-Pabon, M., Vera, J.C.: On the diameter of Kneser graphs. Discret. Math. 305(1–3), 383–385 (2005)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programa de Engenharia de Sistemas e Computação, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil

    Matheus Adauto, Mariana da Cruz & Celina de Figueiredo

  2. Instituto de Matemática e Estatística, Universidade do Estado do Rio de Janeiro, Rio de Janeiro, Brazil

    Diana Sasaki

  3. Department of Mathematics and Applied Mathematics, Virginia Commonwealth University, Richmond, VA, USA

    Matheus Adauto, Viktoriya Bardenova & Glenn Hurlbert

Authors
  1. Matheus Adauto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Viktoriya Bardenova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mariana da Cruz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Celina de Figueiredo
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Glenn Hurlbert
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Diana Sasaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matheus Adauto .

Editor information

Editors and Affiliations

  1. DIM-CMM, Universidad de Chile, Santiago, Chile

    José A. Soto

  2. Technical University of Munich, Munich, Germany

    Andreas Wiese

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Adauto, M., Bardenova, V., da Cruz, M., de Figueiredo, C., Hurlbert, G., Sasaki, D. (2024). Pebbling in Kneser Graphs. In: Soto, J.A., Wiese, A. (eds) LATIN 2024: Theoretical Informatics. LATIN 2024. Lecture Notes in Computer Science, vol 14579. Springer, Cham. https://doi.org/10.1007/978-3-031-55601-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-55601-2_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-55600-5

  • Online ISBN: 978-3-031-55601-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation