The Monochromatic Column problem

15 years 3 months ago

Download euler.slu.edu

Let p1, p2,..., pn be a sequence of n pairwise coprime positive integers, and let P = p1p2...pn. Let 0, 1, ...,m - 1 be a sequence of m different colors. Let A be an n

Ashish K. Srivastava, Steve Szabo

Real-time Traffic

DM 2008 | MP Matrix | Pi Consecutive Entries | Positive Integers |

claim paper

» Empty Monochromatic Triangles

» RamseyType Problem for an Almost Monochromatic K4

» A Column Generation Heuristic for the General Vehicle Routing Problem

» Incremental and General Evaluation of Reverse Nearest Neighbors

» Learning to Recognize Shadows in Monochromatic Natural Images

» Planar Graph Coloring Avoiding Monochromatic Subgraphs Trees and Paths Make It Difficult

» Monomulti bipartite Ramsey numbers designs and matrices

» HighRank Matrix Completion

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DM
Authors	Ashish K. Srivastava, Steve Szabo

Comments (0)

Sciweavers

The Monochromatic Column problem

DM 2008 | MP Matrix | Pi Consecutive Entries | Positive Integers |

Explore & Download

Productivity Tools

Sciweavers