Properly coloured copies and rainbow copies of large graphs with small maximum degree (2012)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- DOI: 10.1002/rsa.20383
- Assunto: TEORIA DE RAMSEY
- Keywords: local lemma; rainbow colourings; proper edge colourings
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Random Structures and Algorithms
- ISSN: 1042-9832
- Volume/Número/Paginação/Ano: v. 40, n. 4, p. 425-436, 2012
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
-
ABNT
BÖTTCHER, Julia e KOHAYAKAWA, Yoshiharu e PROCACCI, Aldo. Properly coloured copies and rainbow copies of large graphs with small maximum degree. Random Structures and Algorithms, v. 40, n. 4, p. 425-436, 2012Tradução . . Disponível em: https://doi.org/10.1002/rsa.20383. Acesso em: 04 jan. 2026. -
APA
Böttcher, J., Kohayakawa, Y., & Procacci, A. (2012). Properly coloured copies and rainbow copies of large graphs with small maximum degree. Random Structures and Algorithms, 40( 4), 425-436. doi:10.1002/rsa.20383 -
NLM
Böttcher J, Kohayakawa Y, Procacci A. Properly coloured copies and rainbow copies of large graphs with small maximum degree [Internet]. Random Structures and Algorithms. 2012 ; 40( 4): 425-436.[citado 2026 jan. 04 ] Available from: https://doi.org/10.1002/rsa.20383 -
Vancouver
Böttcher J, Kohayakawa Y, Procacci A. Properly coloured copies and rainbow copies of large graphs with small maximum degree [Internet]. Random Structures and Algorithms. 2012 ; 40( 4): 425-436.[citado 2026 jan. 04 ] Available from: https://doi.org/10.1002/rsa.20383 - A note on induced cycles in kneser graphs
- On K4-free subgraphs of random graphs
- Ramsey games against a one-armed bandit
- Efficient testing of hypergraphs
- Bounds for optimal coverings
- Almost spanning subgraphs of random graphs after adversarial edge removal
- The chromatic thresholds of graphs
- Percolation in high dimensions
- Small subsets inherit sparse ε-regularity
- An improved upper bound on the density of universal random graphs
Informações sobre o DOI: 10.1002/rsa.20383 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
