Girth, pebbling, and grid thresholds

Andrzej Czygrinow, Glenn Hurlbert

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The pebbling number of a graph is the smallest number t such that from any initial configuration of t pebbles one can move a pebble to any prescribed vertex by a sequence of pebbling steps. It is known that graphs whose connectivity is high compared to their diameter have a pebbling number as small as possible. We will use the above result to prove two related theorems. First, answering a question of the second author, we show that there exist graphs of arbitrarily high constant girth and least possible pebbling number. In the second application, we prove that the product of two graphs of high minimum degree has a pebbling number equal to the number of vertices of the product. This shows that Graham's product conjecture is true in the case of high minimum degree graphs. In addition, we consider a probabilistic variant of the pebbling problem and establish a pebbling threshold result for products of paths. The last result shows that the sequence of paths satisfies the probabilistic analogue of Graham's product conjecture.

Original languageEnglish (US)
Pages (from-to)1-10
Number of pages10
JournalSIAM Journal on Discrete Mathematics
Volume20
Issue number1
DOIs
StatePublished - 2006

Fingerprint

Girth
Grid
Minimum Degree
Graph in graph theory
Graph Connectivity
Path
Analogue
Configuration
Vertex of a graph
Theorem

Keywords

  • Connectivity
  • Girth
  • Grids
  • Pebbling
  • Threshold

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

Girth, pebbling, and grid thresholds. / Czygrinow, Andrzej; Hurlbert, Glenn.

In: SIAM Journal on Discrete Mathematics, Vol. 20, No. 1, 2006, p. 1-10.

Research output: Contribution to journalArticle

Czygrinow, Andrzej ; Hurlbert, Glenn. / Girth, pebbling, and grid thresholds. In: SIAM Journal on Discrete Mathematics. 2006 ; Vol. 20, No. 1. pp. 1-10.
@article{f8679b1d03994186983340f07d3b383e,
title = "Girth, pebbling, and grid thresholds",
abstract = "The pebbling number of a graph is the smallest number t such that from any initial configuration of t pebbles one can move a pebble to any prescribed vertex by a sequence of pebbling steps. It is known that graphs whose connectivity is high compared to their diameter have a pebbling number as small as possible. We will use the above result to prove two related theorems. First, answering a question of the second author, we show that there exist graphs of arbitrarily high constant girth and least possible pebbling number. In the second application, we prove that the product of two graphs of high minimum degree has a pebbling number equal to the number of vertices of the product. This shows that Graham's product conjecture is true in the case of high minimum degree graphs. In addition, we consider a probabilistic variant of the pebbling problem and establish a pebbling threshold result for products of paths. The last result shows that the sequence of paths satisfies the probabilistic analogue of Graham's product conjecture.",
keywords = "Connectivity, Girth, Grids, Pebbling, Threshold",
author = "Andrzej Czygrinow and Glenn Hurlbert",
year = "2006",
doi = "10.1137/S0895480102416374",
language = "English (US)",
volume = "20",
pages = "1--10",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "1",

}

TY - JOUR

T1 - Girth, pebbling, and grid thresholds

AU - Czygrinow, Andrzej

AU - Hurlbert, Glenn

PY - 2006

Y1 - 2006

N2 - The pebbling number of a graph is the smallest number t such that from any initial configuration of t pebbles one can move a pebble to any prescribed vertex by a sequence of pebbling steps. It is known that graphs whose connectivity is high compared to their diameter have a pebbling number as small as possible. We will use the above result to prove two related theorems. First, answering a question of the second author, we show that there exist graphs of arbitrarily high constant girth and least possible pebbling number. In the second application, we prove that the product of two graphs of high minimum degree has a pebbling number equal to the number of vertices of the product. This shows that Graham's product conjecture is true in the case of high minimum degree graphs. In addition, we consider a probabilistic variant of the pebbling problem and establish a pebbling threshold result for products of paths. The last result shows that the sequence of paths satisfies the probabilistic analogue of Graham's product conjecture.

AB - The pebbling number of a graph is the smallest number t such that from any initial configuration of t pebbles one can move a pebble to any prescribed vertex by a sequence of pebbling steps. It is known that graphs whose connectivity is high compared to their diameter have a pebbling number as small as possible. We will use the above result to prove two related theorems. First, answering a question of the second author, we show that there exist graphs of arbitrarily high constant girth and least possible pebbling number. In the second application, we prove that the product of two graphs of high minimum degree has a pebbling number equal to the number of vertices of the product. This shows that Graham's product conjecture is true in the case of high minimum degree graphs. In addition, we consider a probabilistic variant of the pebbling problem and establish a pebbling threshold result for products of paths. The last result shows that the sequence of paths satisfies the probabilistic analogue of Graham's product conjecture.

KW - Connectivity

KW - Girth

KW - Grids

KW - Pebbling

KW - Threshold

UR - http://www.scopus.com/inward/record.url?scp=33847662088&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847662088&partnerID=8YFLogxK

U2 - 10.1137/S0895480102416374

DO - 10.1137/S0895480102416374

M3 - Article

AN - SCOPUS:33847662088

VL - 20

SP - 1

EP - 10

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 1

ER -