A simple regularization of graphs

Details A simple regularization of graphs A simple regularization of graphs

2009-04-30

arxiv.org/abs/0904.4927v1

Mathematics

Combinatorics

12 pages

Scientific paper

The well-known regularity lemma of E. Szemer\'edi for graphs (i.e. 2-uniform hypergraphs) claims that for any graph there exists a vertex partition with the property of quasi-randomness. We give a simple construction of such a partition. It is done just by taking a constant-bounded number of random vertex samplings only one time (thus, iteration-free). Since it is independent from the definition of quasi-randomness, it can be generalized very naturally to hypergraph regularization. In this expository note, we show only a graph case of the paper [I] on hypergraphs, but may help the reader to access [I].

Affiliated with

Also associated with

No associations

Rating

A simple regularization of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A simple regularization of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A simple regularization of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-444124