Sciweavers

73 search results - page 7 / 15
» jct 2007
Sort
View
JCT
2007
90views more  JCT 2007»
14 years 11 months ago
Enumeration problems for classes of self-similar graphs
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
Elmar Teufl, Stephan Wagner
JCT
2007
118views more  JCT 2007»
14 years 11 months ago
Excluding a planar graph from GF(q)-representable matroids
Abstract. We prove that a binary matroid with huge branchwidth contains the cycle matroid of a large grid as a minor. This implies that an infinite antichain of binary matroids ca...
Jim Geelen, Bert Gerards, Geoff Whittle
JCT
2007
84views more  JCT 2007»
14 years 11 months ago
Shelling the coset poset
It is shown that the coset lattice of a finite group has shellable order complex if and only if the group is complemented. Furthermore, the coset lattice is shown to have a Cohen...
Russell Woodroofe
JCT
2007
78views more  JCT 2007»
14 years 11 months ago
Projective-planar signed graphs and tangled signed graphs
A projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every signed graph with no two vertex-disjoint negative circles and no balancing vertex...
Daniel C. Slilaty
79
Voted
JCT
2007
141views more  JCT 2007»
14 years 11 months ago
Partition identities and Ramanujan's modular equations
We show that certain modular equations and theta function identities of Ramanujan imply elegant partition identities. Several of the identities are for t-cores. Key Words: partitio...
Nayandeep Deka Baruah, Bruce C. Berndt