Sciweavers

JCT
2006
46views more  JCT 2006»
13 years 11 months ago
Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
We prove that the anisotropic generating function of self-avoiding polygons is not a D-finite function--proving a conjecture of Guttmann [Discrete Math. 217 (2000) 167
Andrew Rechnitzer
JCT
2006
81views more  JCT 2006»
13 years 11 months ago
New identities involving Bernoulli and Euler polynomials
Abstract. Using the finite difference calculus and differentiation, we obtain several new identities for Bernoulli and Euler polynomials; some extend Miki's and Matiyasevich&#...
Hao Pan, Zhi-Wei Sun
JCT
2006
51views more  JCT 2006»
13 years 11 months ago
Left cells containing a fully commutative element
Let W be a finite or an affine Coxeter group and Wc the set of all the fully commutative elements in W. For any left cell L of W containing some fully commutative element, our main...
Jian-Yi Shi
JCT
2006
40views more  JCT 2006»
13 years 11 months ago
Erdos-Ko-Rado for three sets
Dhruv Mubayi
JCT
2006
81views more  JCT 2006»
13 years 11 months ago
Constructions of generalized Sidon sets
We give explicit constructions of sets S with the property that for each integer k, there are at most g solutions to k = s1 + s2, si S; such sets are called Sidon sets if g = 2 a...
Greg Martin, Kevin O'Bryant
JCT
2006
79views more  JCT 2006»
13 years 11 months ago
A class of perfectly contractile graphs
We consider the class A of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between th...
Frédéric Maffray, Nicolas Trotignon
JCT
2006
54views more  JCT 2006»
13 years 11 months ago
Matroid packing and covering with circuits through an element
Abstract. In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the maximum number of disjoint circuits and
Manoel Lemos, James G. Oxley
JCT
2006
36views more  JCT 2006»
13 years 11 months ago
A linear programming formulation of Mader's edge-disjoint paths problem
Judith Keijsper, Rudi Pendavingh, Leen Stougie
JCT
2006
81views more  JCT 2006»
13 years 11 months ago
Independent sets in triangle-free cubic planar graphs
: We prove that every triangle-free planar graph on n vertices with maximum degree three has an independent set with size at least 3 8 n. This was suggested and later conjectured b...
Christopher Carl Heckman, Robin Thomas
JCT
2006
69views more  JCT 2006»
13 years 11 months ago
The Ramsey number for hypergraph cycles I
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojt...