We describe a new circulation-based method to determine cuts in an undirected graph. A circulation is an oriented labeling of edges with integers so that at each vertex, the sum of the in-labels equals the sum of out-labels. For an integer k, our approach is based on simple algorithms for sampling a circulation (mod k) uniformly at random. We prove that with high probability, certain dependenci...

An r-cut of the complete r-uniform hypergraph Kr n is obtained by partitioning its vertex set into r parts and taking all edges that meet every part in exactly one vertex. In other words it is the edge set of a spanning complete r-partite subhypergraph of Kr n. An r-cut cover is a collection of r-cuts so that each edge of K r n is in at least one of the cuts. While in the graph case r = 2 any 2...

In this paper, some kinds of cut sets for R̄-fuzzy sets are introduced and their properties are given. Moreover, the decomposition theorems and representation theorems on R̄-fuzzy sets are obtained based on different cut sets. Finally, the axiomatic definition of cut set for R̄-fuzzy set is introduced which characterizes the common properties of cut set.

1. Let G = (V,E) be a c-edge connected graph. In other words, assume that the size of minimum cut in G is at least c. Construct a graph G′(V,E ′) by sampling each edge of G with probability p independently at random and reweighing each edge with weight 1/p. Suppose c > log n, and is such that log(n) c 2 ≤ 1. Show that as long as p ≥ log(n) c 2 , with high probability the size of every cut in G′...

The maximum flow algorithm has long been known for calculating the minimum edge cut of any two vertices of a connected graph. The original algorithm, however, does not tell us which edges should be taken exactly and therefore there could be more than one way to construct a minimum-edge-cut set. In this paper, we propose a new method to get a minimum-edge-cut set by selecting edges of a graph in...

1. Let G = (V,E) be a c-edge connected graph. In other words, assume that the size of minimum cut in G is at least c. Construct a graph G′(V,E ′) by sampling each edge of G with probability p independently at random and reweighing each edge with weight 1/p. Suppose c > log n, and is such that 10 log(n) c 2 ≤ 1. Show that as long as p ≥ 10 log(n) c 2 , with high probability the size of every cut...

The cut sets of a graph are special vertices whose removal disconnects the graph. They fundamental in study binomial edge ideals, since they encode their minimal primary decomposition. We introduce class accessible graphs as with unmixed ideal and form an set system. prove that is Cohen-Macaulay we conjecture converse holds. settle for large classes graphs, including chordal traceable providing...