On the maximum density of fixed strongly connected subtournaments LN Coregliano, RF Parente, CM Sato
arXiv preprint arXiv:1505.05200, 2015
20 2015 No additional tournaments are quasirandom-forcing R Hancock, A Kabela, T Martins, R Parente, F Skerman, J Volec
European Journal of Combinatorics 108, 103632, 2023
14 2023 On the number of orientations of random graphs with no directed cycles of a given length P Allen, Y Kohayakawa, GO Mota, RF Parente
The Electronic Journal of Combinatorics, P1. 52-P1. 52, 2014
7 2014 On the Zero-Sum Ramsey Problem over JD Alvarado, L Colucci, R Parente, V Souza
Latin American Symposium on Theoretical Informatics, 445-459, 2022
2 2022 Empacotamento e contagem em digrafos: cenários aleatórios e extremais RF Parente
Universidade de São Paulo, 2016
2 2016 A note on counting orientations Y Kohayakawa, GO Mota, RF Parente
Electronic Notes in Discrete Mathematics 37, 3-8, 2011
2 2011 Packing arborescences in random digraphs C Hoppen, RF Parente, CM Sato
SIAM Journal on Discrete Mathematics 33 (1), 438-453, 2019
1 2019 Packing arborescences in random digraphs C Hoppen, RF Parente, CM Sato
arXiv preprint arXiv:1605.05764, 2016
1 2016 On a problem of Caro on JD Alvarado, L Colucci, R Parente
arXiv preprint arXiv:2503.01032, 2025
2025 Proper edge colorings of complete graphs without repeated triangles F Botler, L Colucci, P Matias, G Mota, R Parente, M Secco
Encontro de Teoria da Computação (ETC), 65-68, 2022
2022 On the zero-sum Ramsey problem over'Z POT. d IND. 2' JDA Morales, L Colucci, RF Parente, VS Souza
Proceedings, 2022
2022 Hitting times for arc-disjoint arborescences in random digraph processes M Collares, Y Kohayakawa, T Martins, R Parente, V Souza
Procedia Computer Science 195, 376-384, 2021
2021 No additional tournaments are quasirandom-forcing T Martins, R Parente, F Skerman, J Volec
arXiv preprint arXiv:1912.04243, 2019
2019 Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges C Hoppen, GO Mota, RF Parente, CM Sato
Electronic Notes in Theoretical Computer Science 346, 535-544, 2019
2019 No additional tournaments are quasirandom forcing F Skerman, R Hancock, A Kabela, D Kral, T Martins, R Parente, J Volec
2019 Packing arborescences in random digraphs C Hoppen, RF Parente, CM Sato
Electronic Notes in Discrete Mathematics 61, 615-621, 2017
2017 Utilizando álgebras de flags para problemas de combinatória extremal RF Parente, CM Sato
Encontro de Teoria da Computação (ETC), 92-95, 2017
2017 Quantidade de orientações de grafos livres de circuitos direcionados cíclicos RF Parente
Universidade de São Paulo, 2012
2012 Contagem de Estruturas em Combinatória Aditiva A Sant’Anna, R Parente
Fiona Skerman T Martins, R Parente, J Volec
