Showing 2017Show all
2 papers · 1 filter
math.CO2017
On Edge-Colored Saturation Problems
Michael Ferrara, Daniel Johnston, Sarah Loeb +6
Let be a family of edge-colored graphs. A -edge colored graph is -saturated if does not contain any graph in but the additi…
math.CO2017
List-Distinguishing Cartesian Products of Cliques
Michael Ferrara, Zoltan Furedi, Sogol Jahanbekam +1
The distinguishing number of a graph , denoted , is the minimum number of colors needed to produce a coloring of the vertices of so that every nontrivial isomorphism i…