Quasi-randomness of graph balanced cut properties
نویسندگان
چکیده
منابع مشابه
Quasi-randomness of graph balanced cut properties
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster proved the following result on quasi-randomness of graphs. Let k ≥ 2 be a fixed integer, α1, . . . , αk be positive reals satisfying ∑ i αi = 1 and (α1, . . . , αk) 6= (1/k, . . . , 1/k), and G be a graph on n ver...
متن کاملThe quasi-randomness of hypergraph cut properties
Let α1, . . . , αk satisfy ∑ i αi = 1 and suppose a k-uniform hypergraph on n vertices satisfies the following property; in any partition of its vertices into k sets A1, . . . , Ak of sizes α1n, . . . , αkn, the number of edges intersecting A1, . . . , Ak is (asymptotically) the number one would expect to find in a random k-uniform hypergraph. Can we then infer that H is quasi-random? We show t...
متن کامل8.1 Balanced Cut
In the last lecture, we described an O(log k logD)-approximation algorithm for Sparsest Cut, where k is the number of terminal pairs and D is the total requirement. Today we will describe an application of Sparsest Cut to the Balanced Cut problem. We will then develop an O(log k)approximation algorithm for Sparsest Cut, due to Linial, London, and Rabinovich [4], using metric embeddings techniqu...
متن کاملComplexity and Quasi - randomness 1
Many problems arising in interactive and distributive computation share the general framework that a number of processors wish to collaboratively evaluate a Boolean function while each processor has only partial information. The question of interest is to determine the minimum amount of information transfer required under the assumption that each processor has unlimited computational power and ...
متن کاملBipartite Subgraphs and Quasi-Randomness
We say that a family of graphs G = {Gn : n ≥ 1} is p-quasi-random, 0 < p < 1, if it shares typical properties of the random graph G(n, p); for a definition, see below. We denote by Q(p) the class of all graphs H for which e(Gn) ≥ (1 + o(1))p ( n 2 ) and the number of not necessarily induced labeled copies of H in Gn is at most (1 + o(1))pn imply that G is p-quasi-random. In this note, we show t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2011
ISSN: 1042-9832
DOI: 10.1002/rsa.20384