1215 search results - page 112 / 243 » Combinatorics |
101
click to vote
COMBINATORICS
2007
15 years 3 months ago
2007
We refine previous results to provide examples, and in some cases precise classifications, of extremal subsets of {1, ..., n} containing no solutions to a wide class of non-inva...
126
Voted
COMBINATORICS
2007
15 years 3 months ago
2007
We define a partial order on colored compositions with many properties analogous to Young’s lattice. We show that saturated chains correspond to colored permutations, and that ...
117
Voted
COMBINATORICS
2007
15 years 3 months ago
2007
It is shown that the (diagonal) size Ramsey numbers of complete m-partite graphs Km(n) can be bounded from below by cn22(m−1)n, where c is a positive constant. Key words: Size R...
128
Voted
COMBINATORICS
2007
15 years 3 months ago
2007
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementa...
120
Voted
COMBINATORICS
2007
15 years 3 months ago
2007
We generalize the classical work of de Bruijn, Knuth and Rice (giving the asymptotics of the average height of Dyck paths of length n) to the case of p–watermelons with a wall (...