Carl R. Yerger

activity

20042025

most citedCover pebbling numbers and bounds for certain families of graphs

13 citations · 29 across the 11 of their papers we have counts for

collaborators

12 papers

math.CO2025

Ramsey Theory on the Integer Grid: The "L" Problem

Isaac Mammel, William Smith, Carl Yerger

In an $[n] \times [n]$ integer grid, a monochromatic $L$ is any set of points ${(i, j), (i, j + t), (i + t, j + t)}$ for some positive integer $t$ , where $1 \leq i, j, i + t, j + t \leq n$ …

math.CO2024

Bilevel Programming for Pebbling Numbers of Lemke Graph Products

Jonad Pulaj, Kenan Wood, Carl Yerger

Given a configuration of indistinguishable pebbles on the vertices of a graph, a pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacen…

math.CO2023

Automating Weight Function Generation in Graph Pebbling

Dominic Flocco, Jonad Pulaj, Carl Yerger

Graph pebbling is a combinatorial game played on an undirected graph with an initial configuration of pebbles. A pebbling move consists of removing two pebbles from one vertex and…

math.CO2023

Lollipop and Cubic Weight Functions for Graph Pebbling

Marshall Yang, Carl Yerger, Runtian Zhou

Given a configuration of pebbles on the vertices of a graph $G$ , a pebbling move removes two pebbles from a vertex and puts one pebble on an adjacent vertex. The pebbling number of…

math.CO2015

Modified Linear Programming and Class 0 Bounds for Graph Pebbling

Daniel W. Cranston, Luke Postle, Chenxiao Xue +1

Given a configuration of pebbles on the vertices of a connected graph $G$ , a \emph{pebbling move} removes two pebbles from some vertex and places one pebble on an adjacent vertex.…

math.CO2014★ 1 cited

On Three Sets with Nondecreasing Diameter

Daniel Bernstein, David J. Grynkiewicz, Carl R. Yerger

Let $[a, b]$ denote the integers between $a$ and $b$ inclusive and, for a finite subset $X \subseteq Z$ , let the diameter of $X$ be equal to $max (X) - min (X)$ . We write $X<…