most citedThe constant objective value property for combinatorial optimization problems

3 citations · 7 across the 4 of their papers we have counts for

collaborators
Showing math.NTShow all

1 paper · 1 filter

math.NT2014

On conjectures and problems of Ruzsa concerning difference graphs of S-units

Ante Custic, Lajos Hajdu, Dijana Kreso +1

Given a finite nonempty set of primes S, we build a graph with vertex set by connecting x and y if the prime divisors of both the numerator and denominat…