5 papers · 1 filter
Fractional Isomorphism of Graphons
Jan Grebík, Israel Rocha
We work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in…
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…
Relating the cut distance and the weak* topology for graphons
Martin Doležal, Jan Grebík, Jan Hladký +2
The theory of graphons is ultimately connected with the so-called cut norm. In this paper, we approach the cut norm topology via the weak* topology (when considering a predual of $…
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…
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…