This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A119414 Number of triangle-free graphs g on n nodes for which the chromatic number chi(g) equals r(g)=ceil((Delta(g)+1+omega(g))/2). 0
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 21, 826, 39889 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,12 COMMENTS Here Delta(g)=maximum node degree of g and omega(g)=clique number of g (=2 for triangle-free graphs). r(g) is conjectured by Reed to be an upper bound for chi(g) for all graphs. The sequence is of interest as a measure of how frequently the bound is attained. For example, for n=14 there are 467871369 triangle-free graphs. REFERENCES B. Reed, omega, Delta and chi, J Graph Theory 27, 177-212 (1998). LINKS CROSSREFS Sequence in context: A012645 A220069 A028469 * A012819 A295038 A295529 Adjacent sequences:  A119411 A119412 A119413 * A119415 A119416 A119417 KEYWORD nonn AUTHOR Keith Briggs (keith.briggs(AT)bt.com), Jul 26 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.