4 citations · 4 across the 3 of their papers we have counts for
5 papers
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…
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…
The Saturation Number of Induced Subposets of the Boolean Lattice
Michael Ferrara, Bill Kay, Lucas Kramer +4
Given a poset , a family of elements in the Boolean lattice is said to be -saturated if (1) contains no copy of as a subposet and (2) every proper superset of …
On the Strong Chromatic Index of Sparse Graphs
Philip DeOrsey, Jennifer Diemunsch, Michael Ferrara +7
The strong chromatic index of a graph , denoted , is the least number of colors needed to edge-color so that edges at distance at most two receive distinct colors.…
Saturation numbers in tripartite graphs
Eric Sullivan, Paul S. Wenger
Given graphs and , a subgraph is an -saturated subgraph of if , but for all . The saturation n…