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 2021Show all

3 papers · 1 filter

cs.DS2021★ 1 cited

Efficient diagonalization of symmetric matrices associated with graphs of small treewidth

Martin Fürer, Carlos Hoppen, Vilmar Trevisan

Let $M = (m_{ij})$ be a symmetric matrix of order $n$ whose elements lie in an arbitrary field $F$ , and let $G$ be the graph with vertex set ${1, \dots, n}$ such that disti…

math.CO2021

An extension of the rainbow Erdős-Rothschild problem

Carlos Hoppen, Hanno Lefmann, Denilson Amaral Nolibos

Given integers $r \geq 2$ , $k \geq 3$ and $2 \leq s \leq (2 k)$ , and a graph $G$ , we consider $r$ -edge-colorings of $G$ with no copy of a complete graph $K_{k}$ on $k$ vertice…

math.CO2021

Counting orientations of graphs with no strongly connected tournaments

Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota

Let $S_{k} (n)$ be the maximum number of orientations of an $n$ -vertex graph $G$ in which no copy of $K_{k}$ is strongly connected. For all integers $n$ , $k \geq 4$ where $n \geq 5$ or $k…