Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060407
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
2
0, 0, 0, 1, 2, 2, 3, 4, 6 (list; graph; listen)
OFFSET

3,5

REFERENCES

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

CROSSREFS

Cf. A001839.

Sequence in context: A100483 A014535 A123560 this_sequence A074077 A078381 A118975

Adjacent sequences: A060404 A060405 A060406 this_sequence A060408 A060409 A060410

KEYWORD

nonn

AUTHOR

njas, Apr 06 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 5 01:44 EDT 2008. Contains 143476 sequences.


AT&T Labs Research