An improved upper bound on the density of universal random graphs (2012)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- DOI: 10.1007/978-3-642-29344-3_20
- Assunto: TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: Latin American Symposium on Theoretical Informatics - LATIN
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
DELLAMONICA JUNIOR, Domingos et al. An improved upper bound on the density of universal random graphs. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-29344-3_20. Acesso em: 11 fev. 2026. -
APA
Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2012). An improved upper bound on the density of universal random graphs. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-29344-3_20 -
NLM
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2026 fev. 11 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20 -
Vancouver
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2026 fev. 11 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20 - 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.1007/978-3-642-29344-3_20 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
