Sciweavers

EJC
2006
13 years 11 months ago
Product representations of polynomials
For a fixed polyomial f Z[X], let k(N) denote the maximum size of a set A {1, 2, . . . , N} such that no product of k distinct elements of A is in the value set of f. In this pap...
Jacques Verstraëte
EJC
2006
13 years 11 months ago
Matroid tree-width
Abstract. We show that the tree-width of a graph can be defined without reference to graph vertices, and hence the notion of tree-width can be naturally extended to matroids. (This...
Petr Hlinený, Geoff Whittle
EJC
2006
13 years 11 months ago
Perfect matchings in uniform hypergraphs with large minimum degree
A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a p...
Vojtech Rödl, Andrzej Rucinski, Endre Szemer&...
EJC
2006
13 years 11 months ago
Antisymmetric flows in matroids
We present a seemingly new definition of flows and flow numbers for oriented matroids and prove that the flow number L and the antisymmetric flow number Las of an oriented matroid...
Winfried Hochstättler, Jaroslav Nesetril
EJC
2006
13 years 11 months ago
Counting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
Remco van der Hofstad, Joel Spencer
EJC
2006
13 years 11 months ago
Hamilton cycles in random lifts of graphs
An n-lift of a graph K, is a graph with vertex set V (K)
K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. F...
EJC
2006
13 years 11 months ago
Eulerian colorings and the bipartizing matchings conjecture of Fleischner
Zdenek Dvorak, Tomás Kaiser, Daniel Kr&aacu...