The size-Ramsey number of powers of bounded degree trees (2019)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- Assunto: TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: Bratislava Ústav aplikovanej matematiky Fakulty matematiky, fyziky a informatiky Univerzity Komenského
- Publisher place: Bratislava
- Date published: 2019
- Source:
- Título: Acta mathematica Universitatis Comenianae
- ISSN: 0862-9544
- Volume/Número/Paginação/Ano: v. 88, n. 3, p. 451-456, 2019
- Conference titles: European Conference On Combinatorics, Graph Theory And Applications - EUROCOMB
-
ABNT
BERGER, Sören et al. The size-Ramsey number of powers of bounded degree trees. Acta mathematica Universitatis Comenianae. Bratislava: Bratislava Ústav aplikovanej matematiky Fakulty matematiky, fyziky a informatiky Univerzity Komenského. Disponível em: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1281. Acesso em: 03 nov. 2024. , 2019 -
APA
Berger, S., Kohayakawa, Y., Maesaka, G. S., Martins, T., Mendonça, W., Mota, G. O., & Parczyk, O. (2019). The size-Ramsey number of powers of bounded degree trees. Acta mathematica Universitatis Comenianae. Bratislava: Bratislava Ústav aplikovanej matematiky Fakulty matematiky, fyziky a informatiky Univerzity Komenského. Recuperado de http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1281 -
NLM
Berger S, Kohayakawa Y, Maesaka GS, Martins T, Mendonça W, Mota GO, Parczyk O. The size-Ramsey number of powers of bounded degree trees [Internet]. Acta mathematica Universitatis Comenianae. 2019 ; 88( 3): 451-456.[citado 2024 nov. 03 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1281 -
Vancouver
Berger S, Kohayakawa Y, Maesaka GS, Martins T, Mendonça W, Mota GO, Parczyk O. The size-Ramsey number of powers of bounded degree trees [Internet]. Acta mathematica Universitatis Comenianae. 2019 ; 88( 3): 451-456.[citado 2024 nov. 03 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1281 - A practical minimal perfect hashing method
- Evolution of random subgraphs of the cube
- On Richardson's model on the hypercube
- The Turan theorem for random graphs
- Embedding graphs with bounded degree in sparse pseudorandom graphs
- Universality and tolerance
- Hereditary properties of triple systems
- An optimal algorithm for checking regularity
- Searching in Random partially ordered sets
- Discrepancy and eigenvalues of Cayley graphs
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 2976181.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
