Pseudo-random graphs

Details Pseudo-random graphs Pseudo-random graphs

2005-03-31

arxiv.org/abs/math/0503745v1

Mathematics

Combinatorics

50 pages

Scientific paper

Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in proving an enormous number of combinatorial statements, making their role quite hard to overestimate. Their tremendous success serves as a natural motivation for the following very general and deep informal questions: what are the essential properties of random graphs? How can one tell when a given graph behaves like a random graph? How to create deterministically graphs that look random-like? This leads us to a concept of pseudo-random graphs and the aim of this survey is to provide a systematic treatment of this concept.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-721080