Quasi-random oriented graphs

Details Quasi-random oriented graphs Quasi-random oriented graphs

2011-01-28

arxiv.org/abs/1101.5421v2

Mathematics

Combinatorics

11 pages

Scientific paper

We show that a number of conditions on oriented graphs, all of which are satisfied with high probability by randomly oriented graphs, are equivalent. These equivalences are similar to those given by Chung, Graham and Wilson in the case of unoriented graphs, and by Chung and Graham in the case of tournaments. Indeed, our main theorem extends to the case of a general underlying graph G the main result of Chung and Graham which corresponds to the case that G is complete. One interesting aspect of these results is that exactly two of the four orientations of a four-cycle can be used for a quasi-randomness condition, i.e., if the number of appearances they make in D is close to the expected number in a random orientation of the same underlying graph, then the same is true for every small oriented graph H

Affiliated with

Also associated with

No associations

Rating

Quasi-random oriented 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 Quasi-random oriented graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quasi-random oriented graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-550450