Seguir
Carlos Hoppen
Carlos Hoppen
Instituto de Matemática e Estatística, Universidade Federal do Rio Grande do Sul
E-mail confirmado em ufrgs.br
Título
Citado por
Citado por
Ano
Limits of permutation sequences
C Hoppen, Y Kohayakawa, CG Moreira, B Rath, R Menezes Sampaio
Journal of Combinatorial Theory, Series B, 2012
1612012
On the sum of the Laplacian eigenvalues of a tree
E Fritscher, C Hoppen, I Rocha, V Trevisan
Linear Algebra and its Applications 435 (2), 371-399, 2011
1052011
Testing permutation properties through subpermutations
C Hoppen, Y Kohayakawa, CG Moreira, RM Sampaio
Theoretical Computer Science 412 (29), 3555-3567, 2011
402011
Limits of permutation sequences through permutation regularity
C Hoppen, Y Kohayakawa, CGTA Moreira, RM Sampaio
arXiv preprint arXiv:1106.1663, 2011
352011
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
FS Benevides, C Hoppen, RM Sampaio
Discrete Mathematics 340 (9), 2143-2160, 2017
342017
A rainbow Erdös--Rothschild problem
C Hoppen, H Lefmann, K Odermann
SIAM Journal on Discrete Mathematics 31 (4), 2647-2674, 2017
33*2017
Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
C Hoppen, Y Kohayakawa, H Lefmann
European Journal of Combinatorics 35, 354-373, 2014
292014
Hypergraphs with many Kneser colorings
C Hoppen, Y Kohayakawa, H Lefmann
European Journal of Combinatorics, 2011
27*2011
Local algorithms, regular graphs of large girth, and random regular graphs
C Hoppen, N Wormald
Combinatorica 38 (3), 619-664, 2018
252018
Edge colourings of graphs avoiding monochromatic matchings of a given size
C Hoppen, Y Kohayakawa, H Lefmann
Combinatorics, Probability and Computing 21 (1-2), 203-218, 2012
252012
Edge-colorings avoiding a fixed matching with a prescribed color pattern
C Hoppen, H Lefmann
European Journal of Combinatorics 47, 75-94, 2015
212015
Characterizing trees with large Laplacian energy
E Fritscher, C Hoppen, I Rocha, V Trevisan
Linear Algebra and its Applications 442, 20-49, 2014
212014
On graphs with a large number of edge-colorings avoiding a rainbow triangle
C Hoppen, H Lefmann, K Odermann
European Journal of Combinatorics 66, 168-190, 2017
202017
Local algorithms, regular graphs of large girth, and random regular graphs
C Hoppen, N Wormald
arXiv preprint arXiv:1308.0266, 2013
182013
Induced forests in regular graphs with large girth
C Hoppen, N Wormald
Combinatorics, Probability and Computing 17 (3), 389-410, 2008
182008
Properties of graphs with large girth
C Hoppen
University of Waterloo, 2008
172008
Densities in large permutations and parameter testing
R Glebov, C Hoppen, T Klimošová, Y Kohayakawa, H Liu
European Journal of Combinatorics 60, 89-99, 2017
162017
Properties of regular graphs with large girth via local algorithms
C Hoppen, N Wormald
Journal of Combinatorial Theory, Series B 121, 367-397, 2016
142016
Geodesics and almost geodesic cycles in random regular graphs
I Benjamini, C Hoppen, E Ofek, P Prałat, N Wormald
Journal of Graph Theory 66 (2), 115-136, 2011
142011
Property testing and parameter testing for permutations
C Hoppen, Y Kohayakawa, CG Moreira, RM Sampaio
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010
132010
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20