492 search results - page 71 / 99 » combinatorics 2006 |
147
click to vote
COMBINATORICS
2000
15 years 5 months ago
2000
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
147
click to vote
COMBINATORICS
2000
15 years 5 months ago
2000
In a previous paper it was established that there are at least 27 non-isomorphic strongly regular (40, 12, 2, 4) graphs. Using a different and more efficient method we have re-inv...
150
Voted
COMBINATORICS
2000
15 years 5 months ago
2000
We prove a conjecture of Cohn and Propp, which refines a conjecture of Bosley and Fidkowski about the symmetry of the set of alternating sign matrices (ASMs). We examine data aris...
101
click to vote
COMBINATORICS
2002
15 years 5 months ago
2002
A fork stack is a generalised stack which allows pushes and pops of several items at a time. We consider the problem of determining which input streams can be sorted using a singl...
143
click to vote
COMBINATORICS
2002
15 years 5 months ago
2002
Suppose G is r-colorable and P V (G) is such that the components of G[P] are far apart. We show that any (r + s)-coloring of G[P] in which each component is s-colored extends to ...