C. Hoppen

most citedLimits of permutation sequences through permutation regularity

27 citations · 29 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2011★ 27 cited

Limits of permutation sequences through permutation regularity

Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo Tamm de Araújo Moreira +1

A permutation sequence $(σ_{n})_{n \in N}$ is said to be convergent if, for every fixed permutation $τ$ , the density of occurrences of $τ$ in the elements of the sequence co…

math.CO2011★ 2 cited

Hypergraphs with many Kneser colorings (Extended Version)

Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann

For fixed positive integers $r, k$ and $ℓ$ with $1 \leq ℓ < r$ and an $r$ -uniform hypergraph $H$ , let $κ (H, k, ℓ)$ denote the number of $k$ -colorings of the set of hyperedg…

math.MG2006

Geodesics and almost geodesic cycles in random regular graphs

Itai Benjamini, Carlos Hoppen, Eran ofek +2

A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every…