Intersecting edge distinguishing colorings of hypergraphs

Karolina Okrasa, Paweł Rzążewski

An edge labeling of a graph distinguishes neighbors by sets (multisets, resp.), if for any two adjacent vertices $u$ and $v$ the sets (multisets, resp.) of labels appearing on edge…