Sciweavers

173 search results - page 11 / 35
» A Proof of the Two-path Conjecture
Sort
View
COMBINATORICA
2008
112views more  COMBINATORICA 2008»
13 years 7 months ago
On the rigidity of molecular graphs
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
Bill Jackson, Tibor Jordán
CJ
2006
78views more  CJ 2006»
13 years 7 months ago
A Very Mathematical Dilemma
Mathematics is facing a dilemma at its heart: the nature of mathematical proof. We have known since Church and Turing independently showed that mathematical provability was undeci...
Alan Bundy
CSL
2007
Springer
14 years 1 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
COMBINATORICA
2008
89views more  COMBINATORICA 2008»
13 years 7 months ago
The stable set polytope of quasi-line graphs
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier St...
ARSCOM
2002
69views more  ARSCOM 2002»
13 years 7 months ago
On Deuber's partition theorem for (m, p, c)-sets
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...
David S. Gunderson