### Abstract

Erdo{double acute}s estimated the maximal number of integers selected from {1, 2, ..., N}, so that none of them divides the product of two others. In this paper, Erdo{double acute}s' problem is extended to sets of integers such that none of them divides the product of k others. The proofs use combinatorial results.

Original language | English |
---|---|

Pages (from-to) | 260-269 |

Number of pages | 10 |

Journal | European Journal of Combinatorics |

Volume | 31 |

Issue number | 1 |

DOIs | |

Publication status | Published - Jan 2010 |

### Fingerprint

### ASJC Scopus subject areas

- Geometry and Topology
- Theoretical Computer Science
- Computational Theory and Mathematics

### Cite this

*European Journal of Combinatorics*,

*31*(1), 260-269. https://doi.org/10.1016/j.ejc.2009.02.005

**On a problem of Erdo{double acute}s on integers, none of which divides the product of k others.** / Chan, Tsz Ho; Gyori, Ervin; Sárközy, A.

Research output: Contribution to journal › Article

*European Journal of Combinatorics*, vol. 31, no. 1, pp. 260-269. https://doi.org/10.1016/j.ejc.2009.02.005

}

TY - JOUR

T1 - On a problem of Erdo{double acute}s on integers, none of which divides the product of k others

AU - Chan, Tsz Ho

AU - Gyori, Ervin

AU - Sárközy, A.

PY - 2010/1

Y1 - 2010/1

N2 - Erdo{double acute}s estimated the maximal number of integers selected from {1, 2, ..., N}, so that none of them divides the product of two others. In this paper, Erdo{double acute}s' problem is extended to sets of integers such that none of them divides the product of k others. The proofs use combinatorial results.

AB - Erdo{double acute}s estimated the maximal number of integers selected from {1, 2, ..., N}, so that none of them divides the product of two others. In this paper, Erdo{double acute}s' problem is extended to sets of integers such that none of them divides the product of k others. The proofs use combinatorial results.

UR - http://www.scopus.com/inward/record.url?scp=70350238260&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350238260&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2009.02.005

DO - 10.1016/j.ejc.2009.02.005

M3 - Article

AN - SCOPUS:70350238260

VL - 31

SP - 260

EP - 269

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

IS - 1

ER -