Bethel College - Kansas

output

20122017

most citedRainbow arithmetic progressions

2 citations

Showing math.COShow all

3 papers · 1 filter

math.CO2017

The Saturation Number of Induced Subposets of the Boolean Lattice

Michael Ferrara, Bill Kay, Lucas Kramer +4

Given a poset $P$ , a family $F$ of elements in the Boolean lattice is said to be $P$ -saturated if (1) $F$ contains no copy of $P$ as a subposet and (2) every proper superset of $F$ …

math.CO2015★ 1 cited

Color-blind index in graphs of very low degree

Jennifer Diemunsch, Nathan Graber, Lucas Kramer +6

Let $c : E (G) \to [k]$ be an edge-coloring of a graph $G$ , not necessarily proper. For each vertex $v$ , let $c ˉ (v) = (a_{1}, \dots, a_{k})$ , where $a_{i}$ is the number of edges incident…

math.CO2014★ 2 cited

Rainbow arithmetic progressions

Steve Butler, Craig Erickson, Leslie Hogben +8

In this paper, we investigate the anti-Ramsey (more precisely, anti-van der Waerden) properties of arithmetic progressions. For positive integers $n$ and $k$ , the expression $aw([n…