ReP USP - Resultado da busca

Trabalho de evento
Universality and tolerance (2000)
Alon, Noga; Capalbo, Michael; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Ruciânski, Andrzej; Szemerédi, Endre
Conference titles: Annual Symposium on Foundations of Computer Science. Unidade: IME
Assunto: COMPUTAÇÃO GRÁFICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALON, Noga et al. Universality and tolerance. 2000, Anais.. Los alamitos: IEEE Computer Society, 2000. Disponível em: https://doi.org/10.1109/SFCS.2000.892007. Acesso em: 09 jun. 2024.
APA
Alon, N., Capalbo, M., Kohayakawa, Y., Rodl, V., Ruciânski, A., & Szemerédi, E. (2000). Universality and tolerance. In . Los alamitos: IEEE Computer Society. doi:10.1109/SFCS.2000.892007
NLM
Alon N, Capalbo M, Kohayakawa Y, Rodl V, Ruciânski A, Szemerédi E. Universality and tolerance [Internet]. 2000 ;[citado 2024 jun. 09 ] Available from: https://doi.org/10.1109/SFCS.2000.892007
Vancouver
Alon N, Capalbo M, Kohayakawa Y, Rodl V, Ruciânski A, Szemerédi E. Universality and tolerance [Internet]. 2000 ;[citado 2024 jun. 09 ] Available from: https://doi.org/10.1109/SFCS.2000.892007
Artigo de periodico
Ramsey-type results for oriented trees (1996)
Kohayakawa, Yoshiharu ; Luczak, Tomasz; Rodl, Vojtech
Source: Journal of Graph Theory. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz e RODL, Vojtech. Ramsey-type results for oriented trees. Journal of Graph Theory, v. 22, n. 1, p. 1-8, 1996Tradução . . Disponível em: https://doi.org/10.1002/(sici)1097-0118(199605)22:1%3C1::aid-jgt1%3E3.0.co;2-s. Acesso em: 09 jun. 2024.
APA
Kohayakawa, Y., Luczak, T., & Rodl, V. (1996). Ramsey-type results for oriented trees. Journal of Graph Theory, 22( 1), 1-8. doi:10.1002/(sici)1097-0118(199605)22:1%3C1::aid-jgt1%3E3.0.co;2-s
NLM
Kohayakawa Y, Luczak T, Rodl V. Ramsey-type results for oriented trees [Internet]. Journal of Graph Theory. 1996 ; 22( 1): 1-8.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1002/(sici)1097-0118(199605)22:1%3C1::aid-jgt1%3E3.0.co;2-s
Vancouver
Kohayakawa Y, Luczak T, Rodl V. Ramsey-type results for oriented trees [Internet]. Journal of Graph Theory. 1996 ; 22( 1): 1-8.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1002/(sici)1097-0118(199605)22:1%3C1::aid-jgt1%3E3.0.co;2-s
Artigo de periodico
Turán's extremal problem in random graphs: forbidding odd cycles (1996)
Haxell, Penny E; Kohayakawa, Yoshiharu ; Luczak, Tomasz
Source: Combinatorica. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAXELL, Penny E e KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz. Turán's extremal problem in random graphs: forbidding odd cycles. Combinatorica, v. 16, n. 1, p. 107-122, 1996Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF01300129. Acesso em: 09 jun. 2024.
APA
Haxell, P. E., Kohayakawa, Y., & Luczak, T. (1996). Turán's extremal problem in random graphs: forbidding odd cycles. Combinatorica, 16( 1), 107-122. doi:10.1007%2FBF01300129
NLM
Haxell PE, Kohayakawa Y, Luczak T. Turán's extremal problem in random graphs: forbidding odd cycles [Internet]. Combinatorica. 1996 ; 16( 1): 107-122.[citado 2024 jun. 09 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF01300129
Vancouver
Haxell PE, Kohayakawa Y, Luczak T. Turán's extremal problem in random graphs: forbidding odd cycles [Internet]. Combinatorica. 1996 ; 16( 1): 107-122.[citado 2024 jun. 09 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF01300129
Artigo de periodico
The induced size-Ramsey number of cycles (1995)
Haxell, P E; Kohayakawa, Yoshiharu ; Luczak, T
Source: Combinatorics, Probability & Computing. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAXELL, P E e KOHAYAKAWA, Yoshiharu e LUCZAK, T. The induced size-Ramsey number of cycles. Combinatorics, Probability & Computing, v. 4, n. 3, p. 217-239, 1995Tradução . . Disponível em: https://doi.org/10.1017/S0963548300001619. Acesso em: 09 jun. 2024.
APA
Haxell, P. E., Kohayakawa, Y., & Luczak, T. (1995). The induced size-Ramsey number of cycles. Combinatorics, Probability & Computing, 4( 3), 217-239. doi:10.1017/S0963548300001619
NLM
Haxell PE, Kohayakawa Y, Luczak T. The induced size-Ramsey number of cycles [Internet]. Combinatorics, Probability & Computing. 1995 ; 4( 3): 217-239.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1017/S0963548300001619
Vancouver
Haxell PE, Kohayakawa Y, Luczak T. The induced size-Ramsey number of cycles [Internet]. Combinatorics, Probability & Computing. 1995 ; 4( 3): 217-239.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1017/S0963548300001619
Artigo de periodico
Connectivity properties of random subgraphs of the cube (1995)
Bollobás, Béla ; Kohayakawa, Yoshiharu ; Luczak, Tomasz
Source: Random Structures and Algorithms. Unidade: IME
Subjects: COMBINATORIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz. Connectivity properties of random subgraphs of the cube. Random Structures and Algorithms, v. 6, n. 2-3, p. 221-230, 1995Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1002/rsa.3240060210. Acesso em: 09 jun. 2024.
APA
Bollobás, B., Kohayakawa, Y., & Luczak, T. (1995). Connectivity properties of random subgraphs of the cube. Random Structures and Algorithms, 6( 2-3), 221-230. doi:10.1002/rsa.3240060210
NLM
Bollobás B, Kohayakawa Y, Luczak T. Connectivity properties of random subgraphs of the cube [Internet]. Random Structures and Algorithms. 1995 ; 6( 2-3): 221-230.[citado 2024 jun. 09 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1002/rsa.3240060210
Vancouver
Bollobás B, Kohayakawa Y, Luczak T. Connectivity properties of random subgraphs of the cube [Internet]. Random Structures and Algorithms. 1995 ; 6( 2-3): 221-230.[citado 2024 jun. 09 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1002/rsa.3240060210
Artigo de periodico
Sparse anti-Ramsey graphs (1995)
Kohayakawa, Yoshiharu ; Luczak, Tomasz
Source: Journal of Combinatorial Theory, Series B. Unidade: IME
Subjects: COMBINATORIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz. Sparse anti-Ramsey graphs. Journal of Combinatorial Theory, Series B, v. 63, n. 1, p. 146-152, 1995Tradução . . Disponível em: https://doi.org/10.1006/jctb.1995.1010. Acesso em: 09 jun. 2024.
APA
Kohayakawa, Y., & Luczak, T. (1995). Sparse anti-Ramsey graphs. Journal of Combinatorial Theory, Series B, 63( 1), 146-152. doi:10.1006/jctb.1995.1010
NLM
Kohayakawa Y, Luczak T. Sparse anti-Ramsey graphs [Internet]. Journal of Combinatorial Theory, Series B. 1995 ; 63( 1): 146-152.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1006/jctb.1995.1010
Vancouver
Kohayakawa Y, Luczak T. Sparse anti-Ramsey graphs [Internet]. Journal of Combinatorial Theory, Series B. 1995 ; 63( 1): 146-152.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1006/jctb.1995.1010
Artigo de periodico
Turán's extremal problem in random graphs: forbidding even cycles (1995)
Haxell, Penny E; Kohayakawa, Yoshiharu ; Luczak, Tomasz
Source: Journal of Combinatorial Theory, Series B. Unidade: IME
Subjects: COMBINATORIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAXELL, Penny E e KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz. Turán's extremal problem in random graphs: forbidding even cycles. Journal of Combinatorial Theory, Series B, 1995Tradução . . Disponível em: https://doi.org/10.1006/jctb.1995.1035. Acesso em: 09 jun. 2024.
APA
Haxell, P. E., Kohayakawa, Y., & Luczak, T. (1995). Turán's extremal problem in random graphs: forbidding even cycles. Journal of Combinatorial Theory, Series B. doi:10.1006/jctb.1995.1035
NLM
Haxell PE, Kohayakawa Y, Luczak T. Turán's extremal problem in random graphs: forbidding even cycles [Internet]. Journal of Combinatorial Theory, Series B. 1995 ;[citado 2024 jun. 09 ] Available from: https://doi.org/10.1006/jctb.1995.1035
Vancouver
Haxell PE, Kohayakawa Y, Luczak T. Turán's extremal problem in random graphs: forbidding even cycles [Internet]. Journal of Combinatorial Theory, Series B. 1995 ;[citado 2024 jun. 09 ] Available from: https://doi.org/10.1006/jctb.1995.1035
Artigo de periodico
On the diameter and radius of random subgraphs of the cube (1994)
Bollobás, Béla ; Kohayakawa, Yoshiharu ; Luczak, Tomasz
Source: Random Structures and Algorithms. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz. On the diameter and radius of random subgraphs of the cube. Random Structures and Algorithms, v. 5, n. 5, p. 627-648, 1994Tradução . . Disponível em: https://doi.org/10.1002/rsa.3240050503. Acesso em: 09 jun. 2024.
APA
Bollobás, B., Kohayakawa, Y., & Luczak, T. (1994). On the diameter and radius of random subgraphs of the cube. Random Structures and Algorithms, 5( 5), 627-648. doi:10.1002/rsa.3240050503
NLM
Bollobás B, Kohayakawa Y, Luczak T. On the diameter and radius of random subgraphs of the cube [Internet]. Random Structures and Algorithms. 1994 ; 5( 5): 627-648.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1002/rsa.3240050503
Vancouver
Bollobás B, Kohayakawa Y, Luczak T. On the diameter and radius of random subgraphs of the cube [Internet]. Random Structures and Algorithms. 1994 ; 5( 5): 627-648.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1002/rsa.3240050503

USP Schools

ReP

Filtros

Authors

Source title

Funding Agencies

Non normalized affiliation