Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.14126 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914266455474176 |
|---|---|
| author | Anders, Katie Martinez, Able McHugh, Patrick Rogers, Jenna Schmeis, Remi Salinas |
| author_facet | Anders, Katie Martinez, Able McHugh, Patrick Rogers, Jenna Schmeis, Remi Salinas |
| contents | We study the Universal Difference Property (UDP) introduced by Altınok, Anders, Arreola, Asencio, Ireland, Sarıoğ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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_14126 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Structural properties of graphs and the Universal Difference Property Anders, Katie Martinez, Able McHugh, Patrick Rogers, Jenna Schmeis, Remi Salinas Combinatorics 05C25 We study the Universal Difference Property (UDP) introduced by Altınok, Anders, Arreola, Asencio, Ireland, Sarıoğ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. |
| title | Structural properties of graphs and the Universal Difference Property |
| topic | Combinatorics 05C25 |
| url | https://arxiv.org/abs/2601.14126 |