Generalized multiplicative Sidon sets

DOI10.1016/j.jnt.2015.05.018zbMath1332.11035OpenAlexW847854434MaRDI QIDQ2517148

Péter Pál Pach

Publication date: 14 August 2015

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2015.05.018

zbMATH Keywords

multiplicative Sidon set\(C_{2 k}\)-free graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Special sequences and polynomials (11B83) Density, gaps, topology (11B05)

Related Items (4)

On infinite multiplicative Sidon sets ⋮ Improved lower bounds for multiplicative square-free sequences ⋮ The number of multiplicative Sidon sets of integers ⋮ An improved upper bound for the size of the multiplicative 3-Sidon sets

Cites Work

• Unnamed Item
• \(C_ 6\)-free bipartite graphs and product representation of squares
• Cycles of even length in graphs
• On product representation of powers. I
• On the Turán number for the hexagon
• Über ein Problem von K. Zarankiewicz
• The Ramsey-type version of a problem of Pomerance and Schinzel
• Minimal Regular Graphs of Girths Eight and Twelve
• A Note on Bipartite Graphs Without 2 k -Cycles

This page was built for publication: Generalized multiplicative Sidon sets