11949 search results - page 169 / 2390 » Some results on (a:b)-choosability |
IGPL
2008
15 years 1 months ago
2008
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...
FFA
2006
15 years 1 months ago
2006
A linear error-block code is a natural generalization of the classical error-correcting code and has applications in experimental design, high-dimensional numerical integration an...
109
click to vote
COMBINATORICS
2007
15 years 1 months ago
2007
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
COMBINATORICS
2007
15 years 1 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...
112
click to vote
COMBINATORICS
2007
15 years 1 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...