1215 search results - page 144 / 243 » Combinatorics |
102
Voted
COMBINATORICS
1999
15 years 3 months ago
1999
Let G = (V, E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v V , the neighbouring set N(v, C) is the set of vertices of C at d...
126
Voted
COMBINATORICS
1999
15 years 3 months ago
1999
We define and study m-closed cellular algebras (coherent configurations) and m-isomorphisms of cellular algebras which can be regarded as mth approximations of Schurian algebras (...
119
Voted
COMBINATORICS
1999
15 years 3 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
121
Voted
COMBINATORICS
1999
15 years 3 months ago
1999
In this article we use two different methods to find new lower bounds for some multicolored Ramsey numbers. In the first part we use the finite field method used by Greenwood and ...
112
click to vote
IJAC
2010
15 years 24 days ago
2010
This paper studies the combinatorics of the orbit Hecke algebras associated with W