Structural properties of graphs and the Universal Difference Property

TL;DR

This paper investigates the Universal Difference Property (UDP) in graphs, establishing conditions for UDP to hold on specific graph families and its relation to structural properties like subdivisions and edge-disjoint paths.

Contribution

It provides new conditions under which UDP must hold on unicyclic graphs and characterizes the graph families where UDP always holds regardless of edge-labeling.

Findings

UDP must hold on unicyclic graphs under certain conditions

If UDP fails on a graph, it fails on all its subdivisions

Graphs with the pairwise edge-disjoint path property satisfy UDP

Abstract

We study the Universal Difference Property (UDP) introduced by Alt{\i}nok, Anders, Arreola, Asencio, Ireland, Sar{\i}o\u{g}lan, and Smith, focusing on the relationship between the structural properties of a graph and UDP. We present condtions for when UDP must hold on unicyclic graphs. We then prove that if UDP does not hold on an edge-labeled graph, then it cannot hold on any subdivision of that graph. Additionally, we show that if an edge-labeled graph satisfies the pairwise edge-disjoint path property, then the graph satisfies UDP. Lastly, we explore the relationship between UDP and subgraphs and prove that trees and cycles are the only two families of connected graphs for which UDP must hold for any edge-labeling over any ring.