3 papers
math.CO2019
Brouwer's conjecture holds asymptotically almost surely
Israel Rocha
We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found…
math.CO2017
A generalization of Erdős' matching conjecture
Christos Pelekis, Israel Rocha
Let be an -uniform hypergraph on vertices and fix a positive integer such that . A -\emph{matching} of 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…