On sets of integers with restrictions on their products

A {\em product-injective labeling} of a graph $G$ is an injection $χ: V(G) \to \mathbb{Z}$ such that $χ(u)χ(v) \not= χ(x)χ(y)$ for any distinct edges $uv, xy\in E(G)$. Let $P(G)$ be the smallest $N \geq 1$ such that there exists a product-injective labeling $χ: V(G) \rightarrow [N]$. Let $P(n,d)$ be the maximum possible value of $P(G)$ over $n$-vertex graphs $G$ of maximum degree at most $d$. In this paper, we determine the asymptotic value of $P(n,d)$ for all but a small range of values of $d$ relative to $n$. Specifically, we show that there exist constants $a,b > 0$ such that $P(n,d) \sim n$ if $d \leq \sqrt{n}(\log n)^{-a}$ and $P(n,d) \sim n\log n$ if $d \geq \sqrt{n}(\log n)^{b}$.

No reviews yet.

No comments yet.