An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
: A (g, f )-factor of a graph is a subset F of E such that for all v V, g(v) degF(v) f(v). Lovasz gave a necessary and sufficient condition for the existence of a (g, f )-factor...
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...