Add to ORKGWe introduce a large equivalence class of graph properties, all of which are shared by so-called random graphs. Unlike random graphs, however, it is often relatively easy to verify that a particular family of graphs possesses some property in this class
We prove that if a sequence of graphs has (asymptotically) the same distribution of small subgraphs ...
An n-vertex graph G of edge density p is considered to be quasirandom if it shares several important...
AbstractWe prove that if a sequence of graphs has (asymptotically) the same distribution of small su...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the numbe...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
Abstract. We say that a family of graphs G = {Gn: n ≥ 1} is p-quasi-random, 0 < p < 1, if it s...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
AbstractWe use the theory of graph limits to study several quasi-random properties, mainly dealing w...
Abstract. We study some properties of graphs (or, rather, graph se-quences) defined by demanding tha...
AbstractWe use the theory of graph limits to study several quasi-random properties, mainly dealing w...
We prove that if a sequence of graphs has (asymptotically) the same distribution of small subgraphs ...
An n-vertex graph G of edge density p is considered to be quasirandom if it shares several important...
AbstractWe prove that if a sequence of graphs has (asymptotically) the same distribution of small su...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the numbe...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
Abstract. We say that a family of graphs G = {Gn: n ≥ 1} is p-quasi-random, 0 < p < 1, if it s...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
AbstractWe use the theory of graph limits to study several quasi-random properties, mainly dealing w...
Abstract. We study some properties of graphs (or, rather, graph se-quences) defined by demanding tha...
AbstractWe use the theory of graph limits to study several quasi-random properties, mainly dealing w...
We prove that if a sequence of graphs has (asymptotically) the same distribution of small subgraphs ...
An n-vertex graph G of edge density p is considered to be quasirandom if it shares several important...
AbstractWe prove that if a sequence of graphs has (asymptotically) the same distribution of small su...