255 search results - page 5 / 51 » A new upper bound for the bipartite Ramsey problem |
COMBINATORICS
2000
14 years 9 months ago
2000
Given a space endowed with symmetry, we define ms(, r) to be the maximum of m such that for any r-coloring of there exists a monochromatic symmetric set of size at least m. We c...
71
Voted
COCOON
2004
Springer
15 years 2 months ago
2004
Springer
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the com
71
Voted
COMBINATORICS
2004
14 years 9 months ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
89
Voted
ESA
2008
Springer
14 years 11 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...