Sciweavers

DM
2006
80views more  DM 2006»
14 years 25 days ago
A class of combinatorial identities
A general theorem for providing a class of combinatorial identities where the sum is over all the partitions of a positive integer is proven. Five examples as the applications of ...
Yingpu Deng
DM
2006
81views more  DM 2006»
14 years 25 days ago
On an adjacency property of almost all tournaments
Let n be a positive integer. A tournament is called n-existentially closed (or n-e.c.) if for every subset S of n vertices and for every subset T of S, there is a vertex x / S whi...
Anthony Bonato, Kathie Cameron
COMBINATORICS
2006
113views more  COMBINATORICS 2006»
14 years 26 days ago
Monochromatic and Zero-Sum Sets of Nondecreasing Modified Diameter
Let m be a positive integer whose smallest prime divisor is denoted by p, and let Zm denote the cyclic group of residues modulo m. For a set B = {x1, x2, . . . , xm} of m integers...
David J. Grynkiewicz, Rasheed Sabar
COMBINATORICS
2006
90views more  COMBINATORICS 2006»
14 years 26 days ago
On the Number of Possible Row and Column Sums of 0, 1-Matrices
For n a positive integer, we show that the number of of 2n-tuples of integers that are the row and column sums of some n
Daniel Goldstein, Richard Stong
EJC
2008
14 years 27 days ago
Partitions and Clifford algebras
Given the set [n] = {1, . . . , n} for positive integer n, combinatorial properties of Clifford algebras are exploited to count partitions and nonoverlapping partitions of [n]. Th...
René Schott, G. Stacey Staples
EJC
2008
14 years 27 days ago
A simple proof for open cups and caps
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
Jakub Cerný
DM
2008
69views more  DM 2008»
14 years 27 days ago
Connectedness of the graph of vertex-colourings
For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joine...
Luis Cereceda, Jan van den Heuvel, Matthew Johnson
DAM
2008
131views more  DAM 2008»
14 years 27 days ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
DM
2010
114views more  DM 2010»
14 years 27 days ago
Remarks on a generalization of the Davenport constant
A generalization of the Davenport constant is investigated. For a finite abelian group G and a positive integer k, let Dk(G) denote the smallest such that each sequence over G of l...
Michael Freeze, Wolfgang A. Schmid
DM
2010
89views more  DM 2010»
14 years 27 days ago
Polynomial-time dualization of r-exact hypergraphs with applications in geometry
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
Khaled M. Elbassioni, Imran Rauf