C. Hoppen

activity

20062026

most citedLimits of permutation sequences through permutation regularity

27 citations · 71 across the 25 of their papers we have counts for

collaborators

Showing 2016 · math.COShow all

3 papers · 2 filters

math.CO2016

The $p$ -spectral radius of the Laplacian

Elizandro Max Borba, Sebastian Richter, Eliseu Fritscher +1

The $p$ -spectral radius of a graph $G = (V, E)$ with adjacency matrix $A$ is defined as $λ^{(p)} (G) = max {x^{T} A x : ∥ x ∥_{p} = 1}$ . This parameter shows remarkable connections with grap…

math.CO2016

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring

Fabricio S. Benevides, Carlos Hoppen, Rudini Menezes Sampaio

Given a graph $F$ and an integer $r \geq 2$ , a partition $F$ of the edge set of $F$ into at most $r$ classes, and a graph $G$ , define $c_{r, F} (G)$ as the number…

math.CO2016

Packing arborescences in random digraphs

Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato

We study the problem of packing arborescences in the random digraph $D (n, p)$ , where each possible arc is included uniformly at random with probability $p = p (n)$ . Let $λ(\ma…

The p-spectral radius of the Laplacian

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring

Packing arborescences in random digraphs

The $p$ -spectral radius of the Laplacian