14 citations · 36 across the 7 of their papers we have counts for
10 papers
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…
Cut distance identifying graphon parameters over weak* limits
Martin Doležal, Jan Grebík, Jan Hladký +2
The theory of graphons comes with the so-called cut norm and the derived cut distance. The cut norm is finer than the weak* topology (when considering the predual of -functi…
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 $…
Independent sets, cliques, and colorings in graphons
Jan Hladký, Israel Rocha
We study graphon counterparts of the chromatic and the clique number, the fractional chromatic number, the b-chromatic number, and the fractional clique number. We establish some b…
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…