98 citations · 348 across the 30 of their papers we have counts for
Showing 2012 · math.COShow all
3 papers · 2 filters
math.CO2012★ 2 cited
On Weak Chromatic Polynomials of Mixed Graphs
Matthias Beck, Daniel Blado, Joseph Crawford +2
A \emph{mixed graph} is a graph with directed edges, called arcs, and undirected edges. A -coloring of the vertices is proper if colors from are assigned to each v…
math.CO2012
Monochromatic triangles in three-coloured graphs
James Cummings, Daniel Král', Florian Pfender +3
In 1959, Goodman determined the minimum number of monochromatic triangles in a complete graph whose edge set is two-coloured. Goodman also raised the question of proving analogous…
math.CO2012★ 38 cited
On diamond-free subposets of the Boolean lattice
Lucas Kramer, Ryan R. Martin, Michael Young
The Boolean lattice of dimension two, also known as the diamond, consists of four distinct elements with the following property: . A diamond-free family in t…