An old problem of Erd˝os, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem...
Michael Krivelevich, Benny Sudakov, Nicholas C. Wo...
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertices in V . We study the correlation between the events {a → s} and {s → b}. We show that...
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...