Perfect graphs of fixed density: counting and homogenous sets

Details Perfect graphs of fixed density: counting and homogenous sets Perfect graphs of fixed density: counting and homogenous sets

2011-02-25

arxiv.org/abs/1102.5229v1

Mathematics

Combinatorics

19 pages

Scientific paper

For c in [0,1] let P_n(c) denote the set of n-vertex perfect graphs with density c and C_n(c) the set of n-vertex graphs without induced C_5 and with density c. We show that log|P_n(c)|/binom{n}{2}=log|C_n(c)|/binom{n}{2}=h(c)+o(1) with h(c)=1/2 if 1/4

Affiliated with

Also associated with

No associations

Rating

Perfect graphs of fixed density: counting and homogenous sets 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 Perfect graphs of fixed density: counting and homogenous sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Perfect graphs of fixed density: counting and homogenous sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-709923