19 citations · 24 across the 3 of their papers we have counts for
4 papers
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…
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.…
Color-blind index in graphs of very low degree
Jennifer Diemunsch, Nathan Graber, Lucas Kramer +6
Let be an edge-coloring of a graph , not necessarily proper. For each vertex , let , where is the number of edges incident…
Linear Turan numbers of r-uniform linear cycles and related Ramsey numbers
Clayton Collier-Cartaino, Nathan Graber, Tao Jiang
An -uniform hypergraph is called an -graph. A hypergraph is linear if every two edges intersect in at most one vertex. Given a linear -graph and a positive integer …