Sciweavers

JCT
2008
79views more  JCT 2008»
13 years 4 months ago
Packing d-degenerate graphs
We study packings of graphs with given maximal degree. We shall prove that the (hitherto unproved) Bollob
Béla Bollobás, Alexandr V. Kostochka...
JCT
2008
62views more  JCT 2008»
13 years 4 months ago
Generalized quasirandom graphs
László Lovász, Vera T. S&oacu...
JCT
2008
68views more  JCT 2008»
13 years 4 months ago
Matroids with nine elements
Dillon Mayhew, Gordon F. Royle
JCT
2008
101views more  JCT 2008»
13 years 4 months ago
Refined activation strategy for the marking game
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...
Xuding Zhu
JCT
2008
57views more  JCT 2008»
13 years 4 months ago
On generalized separating hash families
Douglas R. Stinson, Ruizhong Wei, Kejun Chen
JCT
2008
86views more  JCT 2008»
13 years 4 months ago
On distinguishing trees by their chromatic symmetric functions
Let T be an unrooted tree. The chromatic symmetric function XT , introduced by Stanley, is a sum of monomial symmetric functions corresponding to proper colorings of T . The subtre...
Jeremy L. Martin, Matthew Morin, Jennifer D. Wagne...
JCT
2008
78views more  JCT 2008»
13 years 4 months ago
A partition bijection related to the Rogers-Selberg identities and Gordon's theorem
We provide a bijective map from the partitions enumerated by the series side of the Rogers-Selberg mod 7 identities onto partitions associated with a special case of Basil Gordon&...
Andrew V. Sills
JCT
2008
46views more  JCT 2008»
13 years 4 months ago
A new short proof of a theorem of Ahlswede and Khachatrian
József Balogh, Dhruv Mubayi
JCT
2008
61views more  JCT 2008»
13 years 4 months ago
Enumerating split-pair arrangements
An arrangement of the multi-set {1, 1, 2, 2, . . . , n, n} is said to be "split-pair"
Ronald L. Graham, Nan Zang