I. Rocha

collaborators

2 papers

math.CO2017

A generalization of Erdős' matching conjecture

Christos Pelekis, Israel Rocha

Let $H = (V, E)$ be an $r$ -uniform hypergraph on $n$ vertices and fix a positive integer $k$ such that $1 \leq k \leq r$ . A $k$ -\emph{matching} of $H$ is a c…

math.CO2017

Layout of random circulant graphs

Sebastian Richter, Israel Rocha

A circulant graph H is defined on the set of vertices V=\left\{ 1,\ldots,n\right\} and edges E=\left\{ \left(i,j\right):\left|i-j\right|\equiv s\left(\textrm{mod}n\right),s\in S\ri…