login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060407 Maximal number of pairwise edge-disjoint monochromatic K_3's in a K_n for any 2-coloring of the edges of K_n. 1
0, 0, 0, 1, 2, 2, 3, 4, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,5

LINKS

Table of n, a(n) for n=3..11.

P. Erdős et al., Edge disjoint monochromatic triangles in 2-colored graphs, Discrete Math., 231 (2001), 135-141.

CROSSREFS

Cf. A001839.

Sequence in context: A263140 A205006 A123560 * A083702 A074077 A078381

Adjacent sequences:  A060404 A060405 A060406 * A060408 A060409 A060410

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Apr 06 2001

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 02:41 EDT 2021. Contains 343937 sequences. (Running on oeis4.)