# On sets of integers with restrictions on their products

@article{Tait2016OnSO, title={On sets of integers with restrictions on their products}, author={Michael Tait and Jacques Verstra{\"e}te}, journal={Eur. J. Comb.}, year={2016}, volume={51}, pages={268-274} }

A product-injective labeling of a graph G is an injection ? : V ( G ) ? Z such that ? ( u ) ? ( v ) ? ? ( x ) ? ( y ) for any distinct edges u v , x y ? E ( G ) . Let P ( G ) be the smallest N ? 1 such that there exists a product-injective labeling ? : V ( G ) ? 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… Expand

#### Topics from this paper

#### 2 Citations

Michael Tait: Research Statement

- 2017

My research uses algebraic and geometric methods to prove theorems in extremal combinatorics. Going the other way, I also use combinatorial methods to prove algebraic results. Algebraic methods are… Expand

Measuring and modeling bipartite graphs with community structure

- Mathematics, Computer Science
- J. Complex Networks
- 2017

Two generative models of large-scale bipartite graphs, also known as two-way graphs or two-mode networks, are proposed that can be easily tuned to reproduce the characteristics of real-world networks, not just qualitatively but quantitatively. Expand

#### References

SHOWING 1-8 OF 8 REFERENCES

Integer sets with prescribed pairwise differences being distinct

- Computer Science, Mathematics
- Eur. J. Comb.
- 2005

The maximum value of D(G) that a graph G of the given order n and size m can have is studied and bounds which are sharp up to a logarithmic multiplicative factor are obtained. Expand

ON SEQUENCES OF INTEGERS NO ONE OF WHICH DIVIDES THE PRODUCT OF TWO OTHERS AND ON SOME RELATED PROBLEMS

- 2004

The sequence of primes is both an A and a B sequence . Our A and B sequences seem of be very much more general, but our theorems show that they cannot be very much more dense than the sequence of the… Expand

The Probabilistic Method

- Computer Science
- SODA
- 1992

A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored. Expand

Random graphs

- Mathematics, Computer Science
- SODA '06
- 2006

Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW. Expand

Introduction To Analytic And Probabilistic Number Theory

- Computer Science
- 2016

This introduction to analytic and probabilistic number theory is free to download and may help people find their favorite readings that end up in malicious downloads. Expand

Sum-injective labellings of graphs

- 2014

Random Graphs, Cambridge university

- 2001

The normal number of prime factors of a number n

- Quarterly Journal of Mathematics
- 1917