On pebbling threshold functions for graph sequences
type: Item
instance of: scholarly article
title: On pebbling threshold functions for graph sequences
zbMATH Open document ID: 1002.05037
DOI: 10.1016/S0012-365X(01)00163-7
author: Andrzej Czygrinow
author: Nancy Eaton
author: P. Mark Kayll
author: Glenn H. Hurlbert
published in: Discrete Mathematics
publication date: 2002-05-28T00:00:00Z
review text: A threshold function for a sequence of graphs \({\mathcal G}= (G_1,G_2,\dots, G_n,\dots)\), where \(G_n\) has \(n\) vertices, is any function \(t_0(n)\) such that almost all distributions of \(t\) pebbles are solvable when \(t/t_0\to 0\) for \(n\to\infty\), and such that almost none are solvable when \(t_0/t\to 0\) for \(n\to\infty\). The authors give bounds on pebbling threshold functions for sequences of several types of graphs.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 1746230
zbMATH Keywords: peppling number
zbMATH Keywords: threshold function
reviewed by: Michael Hager
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1746230