The t-pebbling number is eventually linear in t

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10100317" target="_blank" >RIV/00216208:11320/11:10100317 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

The t-pebbling number is eventually linear in t

Popis výsledku v původním jazyce

In graph pebbling games, one considers a distribution of pebbles on the vertices of a graph, and a pebbling move consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The t-pebbling number pi_t(G) of a graph G is the smallest m such that for every initial distribution of $m$ pebbles on V(G) and every target vertex x there exists a sequence of pebbling moves leading to a distibution with at least t pebbles at x. Answering a question of Sieben, we show that for every graphG, pi_t(G) is eventually linear in t; that is, there are numbers a, b, t_0 such that $pi_t(G)=at+b for all t }= t_0. Our result is also valid for weighted graphs, where every edge e={u,v} has some integer weight omega(e)}= 2, and a pebbling move from uto v removes omega(e) pebbles at u and adds one pebble to v.

Název v anglickém jazyce

The t-pebbling number is eventually linear in t

Popis výsledku anglicky

In graph pebbling games, one considers a distribution of pebbles on the vertices of a graph, and a pebbling move consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The t-pebbling number pi_t(G) of a graph G is the smallest m such that for every initial distribution of $m$ pebbles on V(G) and every target vertex x there exists a sequence of pebbling moves leading to a distibution with at least t pebbles at x. Answering a question of Sieben, we show that for every graphG, pi_t(G) is eventually linear in t; that is, there are numbers a, b, t_0 such that $pi_t(G)=at+b for all t }= t_0. Our result is also valid for weighted graphs, where every edge e={u,v} has some integer weight omega(e)}= 2, and a pebbling move from uto v removes omega(e) pebbles at u and adds one pebble to v.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BD - Teorie informace

OECD FORD obor

—

Projekt

<a href="/cs/project/1M0545" target="_blank" >1M0545: Institut Teoretické Informatiky</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Electronic Journal of Combinatorics

ISSN

1077-8926

e-ISSN

—

Svazek periodika

18

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

4

Strana od-do

"P153", 1-4

Kód UT WoS článku

000293068100006

EID výsledku v databázi Scopus

—