22 search results - page 1 / 5 » A survey of the multiplier conjecture |
DM
2006
13 years 4 months ago
2006
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
ISVD
2007
IEEE
13 years 11 months ago
2007
IEEE
A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a fi...
COMBINATORICS
2004
13 years 4 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
GC
2010
Springer
13 years 3 months ago
2010
Springer
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
IJMMS
2000
13 years 4 months ago
2000
We survey five mathematical discovery programs by looking in detail at the discovery processes they illustrate and the success they've had. We focus on how they estimate the ...