EJC 2006 | Sciweavers

10

EJC
2006

99views Information Technology» more EJC 2006»

13 years 4 months ago

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

claim paper

Read More »

10

click to vote

EJC
2006

92views Information Technology» more EJC 2006»

Matroid tree-width

13 years 4 months ago

Download www.fi.muni.cz

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

claim paper

Read More »

10

click to vote

EJC
2006

86views Information Technology» more EJC 2006»

A construction for non-rank facets of stable set polytopes of webs

13 years 4 months ago

Download www.zib.de

Arnaud Pêcher, Annegret Wagler

claim paper

Read More »

7

click to vote

EJC
2006

104views Information Technology» more EJC 2006»

Perfect matchings in uniform hypergraphs with large minimum degree

13 years 4 months ago

Download main2.amu.edu.pl

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&...

claim paper

Read More »

13

click to vote

EJC
2006

78views Information Technology» more EJC 2006»

On constructive characterizations of (k, l)-sparse graphs

13 years 4 months ago

Download www.cs.elte.hu

László Szegö

claim paper

Read More »

10

click to vote

EJC
2006

119views Information Technology» more EJC 2006»

Antisymmetric flows in matroids

13 years 4 months ago

Download www.fernuni-hagen.de

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

claim paper

Read More »

11

click to vote

EJC
2006

91views Information Technology» more EJC 2006»

Counting connected graphs asymptotically

13 years 4 months ago

Download www.win.tue.nl

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

claim paper

Read More »

12

click to vote

EJC
2006

93views Information Technology» more EJC 2006»

Hamilton cycles in random lifts of graphs

13 years 4 months ago

Download www.math.cmu.edu

An n-lift of a graph K, is a graph with vertex set V (K)

K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. F...