COMBINATORICA
2010
13 years 1 months ago
2010
Let s, t, m, n be positive integers such that sm = tn. Let M(m, s; n, t) be the number of m
COMBINATORICA
2010
13 years 1 months ago
2010
We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we charact...
COMBINATORICA
2010
13 years 1 months ago
2010
We prove that every rayless graph has an unfriendly partition.
COMBINATORICA
2010
13 years 1 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
COMBINATORICA
2010
13 years 4 months ago
2010
For each k 2, let k (0, 1) be the largest number such that there exist k-uniform hypergraphs on n vertices with independent neighborhoods and (k + o(1)) n k edges as n . We pro...
COMBINATORICA
2010
13 years 4 months ago
2010
For finite sets of integers A1, A2 . . . An we study the cardinality of the n-fold sumset A1 +
COMBINATORICA
2010
13 years 4 months ago
2010
COMBINATORICA
2010
13 years 4 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
COMBINATORICA
2010
13 years 4 months ago
2010
A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper d-dimens...
COMBINATORICA
2010
13 years 4 months ago
2010
