Lucas Kramer

activity

20122017

most citedOn diamond-free subposets of the Boolean lattice

38 citations · 41 across the 5 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

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.CO2015

An improved bound on the diamond-free poset problem

Lucas Kramer, Ryan R. Martin

In the theory of partially-ordered sets, the two-dimensional Boolean lattice is known as the diamond. In this paper, we show that, if $F$ is a family in the $n$ -dimension…