K_4-free graphs
Max Alekseyev
maxale at gmail.com
Mon Aug 4 12:47:48 CEST 2008
On Mon, Aug 4, 2008 at 3:38 AM, David Garber <garberad at gmail.com> wrote:
> What can be said on graphs which are K_4-free? (I saw today a paper about a
> bound for the number of triangles in K_4-free graphs)..
Such graphs are covered by sequences A052450 and A052451.
Regards,
Max
Dear Seqfans:
The web page
http://www.research.att.com/~njas/sequences/SubmitA.html
can now be used for adding more terms to an entry
(or for making corrections to the terms - but not
for making other corrections).
The heading says:
Use this page to ADD something
(more terms, a comment, formula, example, reference, link, program, etc.)
to the existing entry for a sequence.
You can also use it to make corrections to the TERMS of a sequence.
I'm hoping this will take care of about 90% of the updates,
and it will make it easler to maintain the OEIS.
So please use it when possible.
Thanks
Neil
More information about the SeqFan
mailing list