By Michael Ferrara and others

Let *\mathcal{C}* be a family of edge-colored graphs. A *t*-edge colored graph *G* is *(\mathcal{C}, t)*-saturated if *G* does not contain any graph in *\mathcal{C}* but the addition of any edge in any color in *[t]* creates a copy of some graph in *\mathcal{C}*. Similarly to classical saturation functions, define... Show more

December 1, 2017

Loading full text...

Similar articles

Loading recommendations...

x1

On Edge-Colored Saturation Problems

Click on play to start listening