On pebbling threshold functions for graph sequences (Q1598791): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
(2 intermediate revisions by one other user not shown) | |||
Property / author | |||
Property / author: Glenn H. Hurlbert / rank | |||
Property / reviewed by | |||
Property / reviewed by: Michael Hager / rank | |||
Property / author | |||
Property / author: Glenn H. Hurlbert / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Michael Hager / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 06:03, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On pebbling threshold functions for graph sequences |
scientific article |
Statements
On pebbling threshold functions for graph sequences (English)
0 references
28 May 2002
0 references
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.
0 references
peppling number
0 references
threshold function
0 references