ReP USP - Resultado da busca

Artigo de periodico
Cross-multiplicative coalescent processes and applications (2021)
Kovchegov, Yevgeniy ; Otto, Peter T.; Yambartsev, Anatoli
Source: Latin American Journal of Probability and Mathematical Statistics. Unidade: IME
Subjects: PROCESSOS ESTOCÁSTICOS, MECÂNICA ESTATÍSTICA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOVCHEGOV, Yevgeniy e OTTO, Peter T. e YAMBARTSEV, Anatoli. Cross-multiplicative coalescent processes and applications. Latin American Journal of Probability and Mathematical Statistics, v. 18, p. 81-106, 2021Tradução . . Disponível em: https://doi.org/10.30757/ALEA.V18-05. Acesso em: 27 nov. 2025.
APA
Kovchegov, Y., Otto, P. T., & Yambartsev, A. (2021). Cross-multiplicative coalescent processes and applications. Latin American Journal of Probability and Mathematical Statistics, 18, 81-106. doi:10.30757/ALEA.V18-05
NLM
Kovchegov Y, Otto PT, Yambartsev A. Cross-multiplicative coalescent processes and applications [Internet]. Latin American Journal of Probability and Mathematical Statistics. 2021 ; 18 81-106.[citado 2025 nov. 27 ] Available from: https://doi.org/10.30757/ALEA.V18-05
Vancouver
Kovchegov Y, Otto PT, Yambartsev A. Cross-multiplicative coalescent processes and applications [Internet]. Latin American Journal of Probability and Mathematical Statistics. 2021 ; 18 81-106.[citado 2025 nov. 27 ] Available from: https://doi.org/10.30757/ALEA.V18-05
Artigo de periodico
Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers (2020)
Pereira, Tiago ; Strien, Sebastian van ; Tanzi, Matteo
Source: Journal of the European Mathematical Society. Unidade: ICMC
Subjects: TEORIA ERGÓDICA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PEREIRA, Tiago e STRIEN, Sebastian van e TANZI, Matteo. Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers. Journal of the European Mathematical Society, v. 22, n. 7, p. 2183–2252, 2020Tradução . . Disponível em: https://doi.org/10.4171/JEMS/963. Acesso em: 27 nov. 2025.
APA
Pereira, T., Strien, S. van, & Tanzi, M. (2020). Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers. Journal of the European Mathematical Society, 22( 7), 2183–2252. doi:10.4171/JEMS/963
NLM
Pereira T, Strien S van, Tanzi M. Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers [Internet]. Journal of the European Mathematical Society. 2020 ; 22( 7): 2183–2252.[citado 2025 nov. 27 ] Available from: https://doi.org/10.4171/JEMS/963
Vancouver
Pereira T, Strien S van, Tanzi M. Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers [Internet]. Journal of the European Mathematical Society. 2020 ; 22( 7): 2183–2252.[citado 2025 nov. 27 ] Available from: https://doi.org/10.4171/JEMS/963
Artigo de periodico
Counting restricted orientations of random graphs (2020)
Collares, Maurício ; Kohayakawa, Yoshiharu ; Morris, Robert; Mota, Guilherme Oliveira
Source: Random Structures & Algorithms. Unidade: IME
Assunto: GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COLLARES, Maurício et al. Counting restricted orientations of random graphs. Random Structures & Algorithms, v. 56, n. 4, p. 1016-1030, 2020Tradução . . Disponível em: https://doi.org/10.1002/rsa.20904. Acesso em: 27 nov. 2025.
APA
Collares, M., Kohayakawa, Y., Morris, R., & Mota, G. O. (2020). Counting restricted orientations of random graphs. Random Structures & Algorithms, 56( 4), 1016-1030. doi:10.1002/rsa.20904
NLM
Collares M, Kohayakawa Y, Morris R, Mota GO. Counting restricted orientations of random graphs [Internet]. Random Structures & Algorithms. 2020 ; 56( 4): 1016-1030.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/rsa.20904
Vancouver
Collares M, Kohayakawa Y, Morris R, Mota GO. Counting restricted orientations of random graphs [Internet]. Random Structures & Algorithms. 2020 ; 56( 4): 1016-1030.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/rsa.20904
Trabalho de evento
The odd chromatic index of almost all graphs (2020)
Botler, Fábio Happ ; Colucci, Lucas; Kohayakawa, Yoshiharu
Source: Anais. Conference titles: Encontro de Teoria da Computação - ETC. Unidade: IME
Subjects: TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ e COLUCCI, Lucas e KOHAYAKAWA, Yoshiharu. The odd chromatic index of almost all graphs. 2020, Anais.. Porto Alegre: SBC, 2020. Disponível em: https://doi.org/10.5753/etc.2020.11087. Acesso em: 27 nov. 2025.
APA
Botler, F. H., Colucci, L., & Kohayakawa, Y. (2020). The odd chromatic index of almost all graphs. In Anais. Porto Alegre: SBC. doi:10.5753/etc.2020.11087
NLM
Botler FH, Colucci L, Kohayakawa Y. The odd chromatic index of almost all graphs [Internet]. Anais. 2020 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.5753/etc.2020.11087
Vancouver
Botler FH, Colucci L, Kohayakawa Y. The odd chromatic index of almost all graphs [Internet]. Anais. 2020 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.5753/etc.2020.11087
Artigo de periodico
Multifractality in random networks with power-law decaying bond strengths (2019)
Vega-Oliveros, Didier A.; Méndez-Bermúdez, J. A; Rodrigues, Francisco Aparecido
Source: Physical Review E. Unidade: ICMC
Subjects: REDES COMPLEXAS, MUDANÇA DE FASE, TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VEGA-OLIVEROS, Didier A. e MÉNDEZ-BERMÚDEZ, J. A e RODRIGUES, Francisco Aparecido. Multifractality in random networks with power-law decaying bond strengths. Physical Review E, v. 99, n. 4, p. 042303-1-042303-7, 2019Tradução . . Disponível em: https://doi.org/10.1103/PhysRevE.99.042303. Acesso em: 27 nov. 2025.
APA
Vega-Oliveros, D. A., Méndez-Bermúdez, J. A., & Rodrigues, F. A. (2019). Multifractality in random networks with power-law decaying bond strengths. Physical Review E, 99( 4), 042303-1-042303-7. doi:10.1103/PhysRevE.99.042303
NLM
Vega-Oliveros DA, Méndez-Bermúdez JA, Rodrigues FA. Multifractality in random networks with power-law decaying bond strengths [Internet]. Physical Review E. 2019 ; 99( 4): 042303-1-042303-7.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1103/PhysRevE.99.042303
Vancouver
Vega-Oliveros DA, Méndez-Bermúdez JA, Rodrigues FA. Multifractality in random networks with power-law decaying bond strengths [Internet]. Physical Review E. 2019 ; 99( 4): 042303-1-042303-7.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1103/PhysRevE.99.042303
Artigo de periodico
The size Ramsey number of short subdivisions of bounded degree graphs (2019)
Kohayakawa, Yoshiharu ; Retter, Troy; Rodl, Vojtech
Source: Random Structures & Algorithms. Unidade: IME
Subjects: GRAFOS ALEATÓRIOS, MÉTODOS PROBABILÍSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e RETTER, Troy e RODL, Vojtech. The size Ramsey number of short subdivisions of bounded degree graphs. Random Structures & Algorithms, v. 54, n. 2, p. 304-339, 2019Tradução . . Disponível em: https://doi.org/10.1002/rsa.20783. Acesso em: 27 nov. 2025.
APA
Kohayakawa, Y., Retter, T., & Rodl, V. (2019). The size Ramsey number of short subdivisions of bounded degree graphs. Random Structures & Algorithms, 54( 2), 304-339. doi:10.1002/rsa.20783
NLM
Kohayakawa Y, Retter T, Rodl V. The size Ramsey number of short subdivisions of bounded degree graphs [Internet]. Random Structures & Algorithms. 2019 ; 54( 2): 304-339.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/rsa.20783
Vancouver
Kohayakawa Y, Retter T, Rodl V. The size Ramsey number of short subdivisions of bounded degree graphs [Internet]. Random Structures & Algorithms. 2019 ; 54( 2): 304-339.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/rsa.20783
Artigo de periodico
Monochromatic trees in random graphs (2019)
Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias
Source: Mathematical Proceedings of the Cambridge Philosophical Society. Unidade: IME
Subjects: GRAFOS ALEATÓRIOS, COMBINATÓRIA PROBABILÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e MOTA, Guilherme Oliveira e SCHACHT, Mathias. Monochromatic trees in random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, v. 166, n. 1, p. 191-208, 2019Tradução . . Disponível em: https://doi.org/10.1017/S0305004117000846. Acesso em: 27 nov. 2025.
APA
Kohayakawa, Y., Mota, G. O., & Schacht, M. (2019). Monochromatic trees in random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, 166( 1), 191-208. doi:10.1017/S0305004117000846
NLM
Kohayakawa Y, Mota GO, Schacht M. Monochromatic trees in random graphs [Internet]. Mathematical Proceedings of the Cambridge Philosophical Society. 2019 ; 166( 1): 191-208.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1017/S0305004117000846
Vancouver
Kohayakawa Y, Mota GO, Schacht M. Monochromatic trees in random graphs [Internet]. Mathematical Proceedings of the Cambridge Philosophical Society. 2019 ; 166( 1): 191-208.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1017/S0305004117000846
Artigo de periodico
Universality for bounded degree spanning trees in randomly perturbed graphs (2019)
Böttcher, Julia; Han, Jie ; Kohayakawa, Yoshiharu ; Montgomery, Richard ; Parczyk, Olaf ; Person, Yury
Source: Random Structures & Algorithms. Unidade: IME
Assunto: GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BÖTTCHER, Julia et al. Universality for bounded degree spanning trees in randomly perturbed graphs. Random Structures & Algorithms, v. 55, n. 4, p. 854-864, 2019Tradução . . Disponível em: https://doi.org/10.1002/rsa.20850. Acesso em: 27 nov. 2025.
APA
Böttcher, J., Han, J., Kohayakawa, Y., Montgomery, R., Parczyk, O., & Person, Y. (2019). Universality for bounded degree spanning trees in randomly perturbed graphs. Random Structures & Algorithms, 55( 4), 854-864. doi:10.1002/rsa.20850
NLM
Böttcher J, Han J, Kohayakawa Y, Montgomery R, Parczyk O, Person Y. Universality for bounded degree spanning trees in randomly perturbed graphs [Internet]. Random Structures & Algorithms. 2019 ; 55( 4): 854-864.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/rsa.20850
Vancouver
Böttcher J, Han J, Kohayakawa Y, Montgomery R, Parczyk O, Person Y. Universality for bounded degree spanning trees in randomly perturbed graphs [Internet]. Random Structures & Algorithms. 2019 ; 55( 4): 854-864.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/rsa.20850
Artigo de periodico
Triangle-free subgraphs of random graphs (2018)
Allen, Peter; Bottcher, Julia; Kohayakawa, Yoshiharu ; Roberts, Barnaby
Source: Combinatorics, Probability & Computing. Unidade: IME
Subjects: COMBINATÓRIA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Triangle-free subgraphs of random graphs. Combinatorics, Probability & Computing, v. 27, n. 2, p. 141-161, 2018Tradução . . Disponível em: https://doi.org/10.1017/S0963548317000219. Acesso em: 27 nov. 2025.
APA
Allen, P., Bottcher, J., Kohayakawa, Y., & Roberts, B. (2018). Triangle-free subgraphs of random graphs. Combinatorics, Probability & Computing, 27( 2), 141-161. doi:10.1017/S0963548317000219
NLM
Allen P, Bottcher J, Kohayakawa Y, Roberts B. Triangle-free subgraphs of random graphs [Internet]. Combinatorics, Probability & Computing. 2018 ; 27( 2): 141-161.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1017/S0963548317000219
Vancouver
Allen P, Bottcher J, Kohayakawa Y, Roberts B. Triangle-free subgraphs of random graphs [Internet]. Combinatorics, Probability & Computing. 2018 ; 27( 2): 141-161.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1017/S0963548317000219
Artigo de periodico
On an anti-Ramsey threshold for sparse graphs with one triangle (2018)
Kohayakawa, Yoshiharu ; Konstadinidis, Pavlos Bahia; Mota, Guilherme Oliveira
Source: Journal of Graph Theory. Unidade: IME
Subjects: TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e KONSTADINIDIS, Pavlos Bahia e MOTA, Guilherme Oliveira. On an anti-Ramsey threshold for sparse graphs with one triangle. Journal of Graph Theory, v. 87, n. 2, p. 176-187, 2018Tradução . . Disponível em: https://doi.org/10.1002/jgt.22150. Acesso em: 27 nov. 2025.
APA
Kohayakawa, Y., Konstadinidis, P. B., & Mota, G. O. (2018). On an anti-Ramsey threshold for sparse graphs with one triangle. Journal of Graph Theory, 87( 2), 176-187. doi:10.1002/jgt.22150
NLM
Kohayakawa Y, Konstadinidis PB, Mota GO. On an anti-Ramsey threshold for sparse graphs with one triangle [Internet]. Journal of Graph Theory. 2018 ; 87( 2): 176-187.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/jgt.22150
Vancouver
Kohayakawa Y, Konstadinidis PB, Mota GO. On an anti-Ramsey threshold for sparse graphs with one triangle [Internet]. Journal of Graph Theory. 2018 ; 87( 2): 176-187.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/jgt.22150
Artigo de periodico
A test of hypotheses for random graph distributions built from EEG data (2017)
Cerqueira, Andressa; Fraiman, Daniel; Vargas, Claudia D.; Leonardi, Florencia Graciela
Source: IEEE Transactions on Network Science and Engineering. Unidade: IME
Assunto: GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CERQUEIRA, Andressa et al. A test of hypotheses for random graph distributions built from EEG data. IEEE Transactions on Network Science and Engineering, v. 4, n. 2, p. 75-82, 2017Tradução . . Disponível em: https://doi.org/10.1109/tnse.2017.2674026. Acesso em: 27 nov. 2025.
APA
Cerqueira, A., Fraiman, D., Vargas, C. D., & Leonardi, F. G. (2017). A test of hypotheses for random graph distributions built from EEG data. IEEE Transactions on Network Science and Engineering, 4( 2), 75-82. doi:10.1109/tnse.2017.2674026
NLM
Cerqueira A, Fraiman D, Vargas CD, Leonardi FG. A test of hypotheses for random graph distributions built from EEG data [Internet]. IEEE Transactions on Network Science and Engineering. 2017 ; 4( 2): 75-82.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/tnse.2017.2674026
Vancouver
Cerqueira A, Fraiman D, Vargas CD, Leonardi FG. A test of hypotheses for random graph distributions built from EEG data [Internet]. IEEE Transactions on Network Science and Engineering. 2017 ; 4( 2): 75-82.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/tnse.2017.2674026
Artigo de periodico
Chromatic thresholds in dense random graphs (2017)
Allen, Peter; Böttcher, Julia; Griffiths, Simon; Kohayakawa, Yoshiharu ; Morris, Robert
Source: Random Structures & Algorithms. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA PROBABILÍSTICA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Chromatic thresholds in dense random graphs. Random Structures & Algorithms, v. 51, n. 2, p. 185-214, 2017Tradução . . Disponível em: https://doi.org/10.1002/rsa.20708. Acesso em: 27 nov. 2025.
APA
Allen, P., Böttcher, J., Griffiths, S., Kohayakawa, Y., & Morris, R. (2017). Chromatic thresholds in dense random graphs. Random Structures & Algorithms, 51( 2), 185-214. doi:10.1002/rsa.20708
NLM
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. Chromatic thresholds in dense random graphs [Internet]. Random Structures & Algorithms. 2017 ; 51( 2): 185-214.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/rsa.20708
Vancouver
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. Chromatic thresholds in dense random graphs [Internet]. Random Structures & Algorithms. 2017 ; 51( 2): 185-214.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/rsa.20708
Artigo de periodico
Chromatic thresholds in sparse random graphs (2017)
Allen, Peter; Böttcher, Julia; Griffiths, Simon; Kohayakawa, Yoshiharu ; Morris, Robert
Source: Random Structures & Algorithms. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA PROBABILÍSTICA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Chromatic thresholds in sparse random graphs. Random Structures & Algorithms, v. 51, n. 2, p. 215–236, 2017Tradução . . Disponível em: https://doi.org/10.1002/rsa.20709. Acesso em: 27 nov. 2025.
APA
Allen, P., Böttcher, J., Griffiths, S., Kohayakawa, Y., & Morris, R. (2017). Chromatic thresholds in sparse random graphs. Random Structures & Algorithms, 51( 2), 215–236. doi:10.1002/rsa.20709
NLM
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. Chromatic thresholds in sparse random graphs [Internet]. Random Structures & Algorithms. 2017 ; 51( 2): 215–236.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/rsa.20709
Vancouver
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. Chromatic thresholds in sparse random graphs [Internet]. Random Structures & Algorithms. 2017 ; 51( 2): 215–236.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/rsa.20709
Trabalho de evento-anais periodico
Monochromatic trees in random graphs (2017)
Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, M
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB'17. Unidade: IME
Subjects: GRAFOS ALEATÓRIOS, TEORIA DE RAMSEY
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e MOTA, Guilherme Oliveira e SCHACHT, M. Monochromatic trees in random graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2017.07.033. Acesso em: 27 nov. 2025. , 2017
APA
Kohayakawa, Y., Mota, G. O., & Schacht, M. (2017). Monochromatic trees in random graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2017.07.033
NLM
Kohayakawa Y, Mota GO, Schacht M. Monochromatic trees in random graphs [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 759-764.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.endm.2017.07.033
Vancouver
Kohayakawa Y, Mota GO, Schacht M. Monochromatic trees in random graphs [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 759-764.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.endm.2017.07.033
Artigo de periodico
A statistical method to distinguish functional brain networks (2017)
Fujita, André ; Vidal, Maciel Calebe ; Takahashi, Daniel Yasumasa
Source: Frontiers in Neuroscience. Unidade: IME
Subjects: ANÁLISE DE VARIÂNCIA, GRAFOS ALEATÓRIOS, SIMULAÇÃO, ESTATÍSTICA APLICADA, CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FUJITA, André e VIDAL, Maciel Calebe e TAKAHASHI, Daniel Yasumasa. A statistical method to distinguish functional brain networks. Frontiers in Neuroscience, v. 11, p. 1-10, 2017Tradução . . Disponível em: https://doi.org/10.3389/fnins.2017.00066. Acesso em: 27 nov. 2025.
APA
Fujita, A., Vidal, M. C., & Takahashi, D. Y. (2017). A statistical method to distinguish functional brain networks. Frontiers in Neuroscience, 11, 1-10. doi:10.3389/fnins.2017.00066
NLM
Fujita A, Vidal MC, Takahashi DY. A statistical method to distinguish functional brain networks [Internet]. Frontiers in Neuroscience. 2017 ; 11 1-10.[citado 2025 nov. 27 ] Available from: https://doi.org/10.3389/fnins.2017.00066
Vancouver
Fujita A, Vidal MC, Takahashi DY. A statistical method to distinguish functional brain networks [Internet]. Frontiers in Neuroscience. 2017 ; 11 1-10.[citado 2025 nov. 27 ] Available from: https://doi.org/10.3389/fnins.2017.00066
Trabalho de evento
Szemerédi’s regularity lemma for sparse graphs (1997)
Kohayakawa, Yoshiharu
Source: Selected papers. Conference titles: Conference on Foundations of Computational Mathematics. Unidade: IME
Subjects: TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu. Szemerédi’s regularity lemma for sparse graphs. 1997, Anais.. Berlin: Springer, 1997. Disponível em: https://doi.org/10.1007/978-3-642-60539-0_16. Acesso em: 27 nov. 2025.
APA
Kohayakawa, Y. (1997). Szemerédi’s regularity lemma for sparse graphs. In Selected papers. Berlin: Springer. doi:10.1007/978-3-642-60539-0_16
NLM
Kohayakawa Y. Szemerédi’s regularity lemma for sparse graphs [Internet]. Selected papers. 1997 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-642-60539-0_16
Vancouver
Kohayakawa Y. Szemerédi’s regularity lemma for sparse graphs [Internet]. Selected papers. 1997 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-642-60539-0_16

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Source title

Countries/Territories

Funding Agencies

Indexado em

Non normalized affiliation

Countries of institutions of collaboration