On Richardson's model on the hypercube (1997)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- DOI: 10.1017/CBO9780511662034.015
- Assunto: COMBINATÓRIA
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: Cambridge University Press
- Publisher place: Cambridge
- Date published: 1997
- Source:
- Título do periódico: Combinatorics, geometry and probability : a tribute to Paul Erdos
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu. On Richardson's model on the hypercube. Combinatorics, geometry and probability : a tribute to Paul Erdos. Tradução . Cambridge: Cambridge University Press, 1997. . Disponível em: https://doi.org/10.1017/CBO9780511662034.015. Acesso em: 24 abr. 2024. -
APA
Bollobás, B., & Kohayakawa, Y. (1997). On Richardson's model on the hypercube. In Combinatorics, geometry and probability : a tribute to Paul Erdos. Cambridge: Cambridge University Press. doi:10.1017/CBO9780511662034.015 -
NLM
Bollobás B, Kohayakawa Y. On Richardson's model on the hypercube [Internet]. In: Combinatorics, geometry and probability : a tribute to Paul Erdos. Cambridge: Cambridge University Press; 1997. [citado 2024 abr. 24 ] Available from: https://doi.org/10.1017/CBO9780511662034.015 -
Vancouver
Bollobás B, Kohayakawa Y. On Richardson's model on the hypercube [Internet]. In: Combinatorics, geometry and probability : a tribute to Paul Erdos. Cambridge: Cambridge University Press; 1997. [citado 2024 abr. 24 ] Available from: https://doi.org/10.1017/CBO9780511662034.015 - 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.1017/CBO9780511662034.015 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas