We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio] (2019)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- DOI: 10.1016/j.entcs.2019.08.001
- Assunto: TEORIA DOS GRAFOS
- Language: Inglês
- Imprenta:
- Source:
- Título: Electronic Notes in Theoretical Computer Science
- ISSN: 1571-0661
- Volume/Número/Paginação/Ano: v. 346, p.1-2, 2019
- Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio]. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.entcs.2019.08.001. Acesso em: 20 fev. 2026. , 2019 -
APA
We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio]. (2019). We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio]. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.entcs.2019.08.001 -
NLM
We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio] [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 1-2.[citado 2026 fev. 20 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.001 -
Vancouver
We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio] [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 1-2.[citado 2026 fev. 20 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.001 - Weak hypergraph regularity and linear hypergraphs
- Property testing and parameter testing for permutations
- The induced size-Ramsey number of cycles
- An extension of the blow-up lemma to arrangeable graphs
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- Regular pairs in sparse random graphs I
- Powers of Hamilton cycles in pseudorandom graphs
- An unstable hypergraph problem with a unique optimal solution
- Turán's extremal problem in random graphs: forbidding even cycles
- Special issue on Ramsey theory. [Editorial]
Informações sobre o DOI: 10.1016/j.entcs.2019.08.001 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3000163.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
