492 search results - page 77 / 99 » combinatorics 2006 |
COMBINATORICS
2006
14 years 9 months ago
2006
An astral configuration (pq, nk) is a collection of p points and n straight lines in the Euclidean plane where every point has q straight lines passing through it and every line h...
COMBINATORICS
2006
14 years 9 months ago
2006
Let Sn be the group of permutations of [n] = {1, . . . , n}. The Bruhat order on Sn is a partial order relation, for which there are several equivalent definitions. Three well-kno...
COMBINATORICS
2006
14 years 9 months ago
2006
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
73
Voted
COMBINATORICS
2006
14 years 9 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...
COMBINATORICS
2006
14 years 9 months ago
2006
In 2001, Shimozono and White gave a description of the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeuwen with the "color-to-spin" property, that i...