An extension of the blow-up lemma to arrangeable graphs (2015)
- Authors:
- USP affiliated author: KOHAYAKAWA, YOSHIHARU - IME
- School: IME
- DOI: 10.1137/13093827X
- Subjects: TEORIA DOS GRAFOS; COMBINATÓRIA; GRAFOS ALEATÓRIOS; MÉTODOS PROBABILÍSTICOS
- Language: Inglês
- Imprenta:
- Place of publication: Philadelphia
- Date published: 2015
- Source:
- Título do periódico: SIAM Journal on Discrete Mathematics
- ISSN: 1095-7146
- Volume/Número/Paginação/Ano: v. 29, n. 2, p. 962-1001, 2015
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
-
ABNT
BOETTCHER, Julia et al. An extension of the blow-up lemma to arrangeable graphs. SIAM Journal on Discrete Mathematics, v. 29, n. 2, p. 962-1001, 2015Tradução . . Disponível em: http://dx.doi.org/10.1137/13093827X. Acesso em: 11 ago. 2022. -
APA
Boettcher, J., Kohayakawa, Y., Taraz, A., & Wuerfl, A. (2015). An extension of the blow-up lemma to arrangeable graphs. SIAM Journal on Discrete Mathematics, 29( 2), 962-1001. doi:10.1137/13093827X -
NLM
Boettcher J, Kohayakawa Y, Taraz A, Wuerfl A. An extension of the blow-up lemma to arrangeable graphs [Internet]. SIAM Journal on Discrete Mathematics. 2015 ; 29( 2): 962-1001.[citado 2022 ago. 11 ] Available from: http://dx.doi.org/10.1137/13093827X -
Vancouver
Boettcher J, Kohayakawa Y, Taraz A, Wuerfl A. An extension of the blow-up lemma to arrangeable graphs [Internet]. SIAM Journal on Discrete Mathematics. 2015 ; 29( 2): 962-1001.[citado 2022 ago. 11 ] Available from: http://dx.doi.org/10.1137/13093827X - Powers of Hamilton cycles in pseudorandom graphs
- Upper bounds on probability thresholds for asymmetric Ramsey properties
- On the triangle removal lemma for subgraphs of sparse pseudorandom graphs
- An algorithmic Friedman-Pippenger theorem on tree embeddings and applications
- On the number of Bh-Sets
- JumpNet: improving connectivity and robustness in unstructured P2P networks by randomness
- A note on the size-Ramsey number of long subdivisions of graphs
- Turan's theorem for pseudo-random graphs
- Turán's extremal problem in random graphs: forbidding odd cycles
- Arithmetic progressions of length three in subsets of a random set
Informações sobre o DOI: 10.1137/13093827X (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
