The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers (2015)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- DOI: 10.1002/rsa.20496
- Subjects: COMBINATÓRIA; ANÁLISE HARMÔNICA
- Language: Inglês
- Imprenta:
- Source:
- Título: Random Structures & Algorithms
- ISSN: 1042-9832
- Volume/Número/Paginação/Ano: v. 46, n. 1, p. 1-25, 2015
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
-
ABNT
KOHAYAKAWA, Yoshiharu et al. The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers. Random Structures & Algorithms, v. 46, n. 1, p. 1-25, 2015Tradução . . Disponível em: https://doi.org/10.1002/rsa.20496. Acesso em: 09 jan. 2026. -
APA
Kohayakawa, Y., Lee, S. J., Roedl, V., & Samotij, W. (2015). The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers. Random Structures & Algorithms, 46( 1), 1-25. doi:10.1002/rsa.20496 -
NLM
Kohayakawa Y, Lee SJ, Roedl V, Samotij W. The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers [Internet]. Random Structures & Algorithms. 2015 ; 46( 1): 1-25.[citado 2026 jan. 09 ] Available from: https://doi.org/10.1002/rsa.20496 -
Vancouver
Kohayakawa Y, Lee SJ, Roedl V, Samotij W. The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers [Internet]. Random Structures & Algorithms. 2015 ; 46( 1): 1-25.[citado 2026 jan. 09 ] Available from: https://doi.org/10.1002/rsa.20496 - Tight Hamilton cycles in random hypergraphs
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
- Measures of pseudorandomness for finite sequences: minimal values
- Hitting time of hamilton cycles in random bipartite graphs
- Measures of pseudorandomness for finite sequences: minimum and typical values
- Testing permutation properties through subpermutations
- An optimal algorithm for checking regularity
- Searching in Random partially ordered sets
- The maximum size of a Sidon set contained in sparse random set of integers
- Hypergraphs with many Kneser colorings
Informações sobre o DOI: 10.1002/rsa.20496 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
