Sciweavers

COMBINATORICA
2010
12 years 11 months ago
Asymptotic enumeration of integer matrices with large equal row and column sums
Let s, t, m, n be positive integers such that sm = tn. Let M(m, s; n, t) be the number of m
E. Rodney Canfield, Brendan D. McKay
COMBINATORICA
2010
12 years 11 months ago
The homology of a locally finite graph with ends
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...
Reinhard Diestel, Philipp Sprüssel
COMBINATORICA
2010
12 years 11 months ago
Every rayless graph has an unfriendly partition
We prove that every rayless graph has an unfriendly partition.
Henning Bruhn, Reinhard Diestel, Agelos Georgakopo...
COMBINATORICA
2010
12 years 11 months ago
Approximation algorithms via contraction decomposition
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...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
COMBINATORICA
2010
13 years 1 months ago
Hypergraphs with independent neighborhoods
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...
Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pik...
COMBINATORICA
2010
13 years 1 months ago
A superadditivity and submultiplicativity property for cardinalities of sumsets
For finite sets of integers A1, A2 . . . An we study the cardinality of the n-fold sumset A1 +
Katalin Gyarmati, Máté Matolcsi, Imr...
COMBINATORICA
2010
13 years 1 months ago
A randomized embedding algorithm for trees
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 ...
Benny Sudakov, Jan Vondrák
COMBINATORICA
2010
13 years 1 months ago
Formulae and growth rates of high-dimensional polycubes
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...
Ronnie Barequet, Gill Barequet, Günter Rote
COMBINATORICA
2010
13 years 1 months ago
On a poset of trees
Péter Csikvári