M. Ferrara

activity

20132018

collaborators

4 papers

math.CO2018

Stability of the potential function

Catherine Erbes, Michael Ferrara, Ryan R. Martin +1

A graphic sequence $π$ is potentially $H$ -graphic if there is some realization of $π$ that contains $H$ as a subgraph. The Erdős-Jacobson-Lehel problem asks to determine $σ (H, n)$ ,…

math.CO2017

On Edge-Colored Saturation Problems

Michael Ferrara, Daniel Johnston, Sarah Loeb +6

Let $C$ be a family of edge-colored graphs. A $t$ -edge colored graph $G$ is $(C, t)$ -saturated if $G$ does not contain any graph in $C$ but the additi…

math.CO2017

List-Distinguishing Cartesian Products of Cliques

Michael Ferrara, Zoltan Furedi, Sogol Jahanbekam +1

The distinguishing number of a graph $G$ , denoted $D (G)$ , is the minimum number of colors needed to produce a coloring of the vertices of $G$ so that every nontrivial isomorphism i…

math.CO2013

On the approximate shape of degree sequences that are not potentially $H$ -graphic

Catherine Erbes, Michael Ferrara, Ryan R. Martin +1

A sequence of nonnegative integers $π$ is {\it graphic} if it is the degree sequence of some graph $G$ . In this case we say that $G$ is a \textit{realization} of $π$ , and we write…

Stability of the potential function

On Edge-Colored Saturation Problems

List-Distinguishing Cartesian Products of Cliques

On the approximate shape of degree sequences that are not potentially H-graphic

On the approximate shape of degree sequences that are not potentially $H$ -graphic