✦ LIBER ✦

A proof of Parisi’s conjecture on the random assignment problem

✍ Scribed by Svante Linusson; Johan Wästlund

Publisher: Springer
Year: 2004
Tongue: English
Weight: 223 KB
Volume: 128
Category: Article
ISSN: 1432-2064
DOI: 10.1007/s00440-003-0308-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A random walk proof of the Erdős-Taylor

A random walk proof of the Erdős-Taylor conjecture

✍ Jay Rosen 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 244 KB

On The Span Of A Random Channel Assignme

On The Span Of A Random Channel Assignment Problem

✍ Colin McDiarmid 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 279 KB

Proof of a Conjecture of Bollob?s on Nes

Proof of a Conjecture of Bollob?s on Nested Cycles

✍ Guantao Chen; Paul Erdós; William Staton 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 221 KB

For any positive integer k, a minimum degree condition is obtained which forces a graph to have k edge-disjoint cycles C 1 , C 2 , ..., C k such that V(C 1

A bijective proof of Kadell's conjecture

A bijective proof of Kadell's conjecture on plane partitions

✍ Dongsu Kim 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 273 KB

Proof of a conjecture of Zahariuta conce

Proof of a conjecture of Zahariuta concerning a problem of Kolmogorov on the ε-entropy

✍ Stéphanie Nivoche 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 433 KB

Proof of a conjecture of Zahariuta conce

Proof of a conjecture of Zahariuta concerning a problem of Kolmogorov on the ε-entropy

✍ Stéphanie Nivoche 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 92 KB