263 search results - page 51 / 53 » ejc 2007 |
EJC
2007
14 years 9 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
EJC
2007
14 years 9 months ago
2007
We give a construction to obtain a t-design from a t-wise balanced design. More precisely, given a positive integer k and a t(v, {k1, k2, . . . , ks}, λ) design D, with with all ...
EJC
2007
14 years 9 months ago
2007
Let Φ be an irreducible root system and ∆ be a base for Φ; it is well known that any root in Φ is an integral combination of the roots in ∆. In comparison to this fact, we ...
EJC
2007
14 years 9 months ago
2007
A 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a sequential ordering, that is, an ordering (e1, e2, . . . , en) such that ({e1, e2, . . . , ek...
EJC
2003
14 years 10 months ago
2003
The goal of this paper is to build a bridge from a certain intuitive conception of natural language communication, called the SLIM theory of language, to a technical approach, cal...