2 papers
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
Saturation of Berge Hypergraphs
Sean English, Nathan Graber, Pamela Kirkpatrick +2
Given a graph , a hypergraph is a Berge- if it can be obtained by expanding each edge in to a hyperedge containing it. A hypergraph is Berge--saturated if does…