A spectral stability theorem for large forbidden graphs

Details A spectral stability theorem for large forbidden graphs A spectral stability theorem for large forbidden graphs

2007-11-22

arxiv.org/abs/0711.3485v1

Mathematics

Combinatorics

Scientific paper

We extend the classical stability theorem of Erdos and Simonovits in two
directions: first, we allow the order of the forbidden graph to grow as log of
order of the host graph, and second, our extremal condition is on the spectral
radius of the host graph.

Affiliated with

Also associated with

No associations

Rating

A spectral stability theorem for large forbidden 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 spectral stability theorem for large forbidden graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A spectral stability theorem for large forbidden graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-310039