492 search results - page 57 / 99 » combinatorics 2006 |
100
click to vote
COMBINATORICS
2000
15 years 5 months ago
2000
We provide a much shorter proof of the following partition theorem of P. Erdos and R. Rado: If X is an uncountable linear order into which neither 1 nor 1 embeds, then X (, 4)3 f...
128
click to vote
COMBINATORICS
2000
15 years 5 months ago
2000
The known methods for constructing complete sets of mutually orthogonal frequency squares all yield one of two parameter sets. We show that almost all these constructions can be d...
132
click to vote
COMBINATORICS
2000
15 years 5 months ago
2000
: We prove two extensions of the Hales-Jewett coloring theorem. The first is a polynomial version of a finitary case of Furstenberg and Katznelson's multiparameter elaboration...
132
click to vote
COMBINATORICS
2000
15 years 5 months ago
2000
A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...
128
click to vote
COMBINATORICS
2000
15 years 5 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...