Talk:Graph pebbling

From Wikipedia, the free encyclopedia

..."after a series of pebbling moves, it is possible to move a pebble to any vertex in the graph."

Does this mean to make it so that each vertex has at least one pebble?

If not, then I don't understand the 2 nodes 1 edge example. If we start with 1 pebble on each node we can't move any pebble? --anon

The challenge is, more accurately, to reach every vertex. If we start with a pebble on a vertex, we have already reached that vertex. --AaronRosenberg 19:58, 27 April 2007 (UTC)

--Insufficient Context Note-- Why is this note still there? Is there really still insufficient context for this page? I'll grant that it needs to be linked more thoroughly, but the page itself is sound in my opinion. --AaronRosenberg 19:58, 27 April 2007 (UTC)

--Insufficient Context Note-- I agree, and after having made a few changes (hopefully for the better), I'm just going to count two opinions as a consensus and remove that tag.--Nathan Clement 01:09, 24 September 2007 (UTC)