2 citations · 3 across the 6 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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
Local Configurations in Union-Closed Families
Jonad Pulaj, Kenan Wood
The Frankl or Union-Closed Sets conjecture states that for any finite union-closed family of sets containing some nonempty set, there is some element in the groun…