✦ LIBER ✦

A Simpler Proof of

✍ Scribed by Roman Karasev

Book ID: 106150094
Publisher: Springer
Year: 2011
Tongue: English
Weight: 241 KB
Volume: 47
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-011-9332-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simpler proof of a theorem of Steinmet

A simpler proof of a theorem of Steinmetz

✍ Fred Gross; Charles F Osgood 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Simpler proof of a realizability theorem

Simpler proof of a realizability theorem on Delaunay triangulations

✍ Kokichi Sugihara 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 293 KB

A simpler proof and a generalization of

A simpler proof and a generalization of the zero-trees theorem

✍ A Schrijver; P.D Seymour 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 290 KB

A Simpler Proof of the Excluded Minor Th

A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces

✍ Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We give a simple proof of the fact (which follows from the Robertson Seymour theory) that a graph which is minimal of genus g cannot contain a subdivision of a large grid. Combining this with the tree-width theorem and the quasi-wellordering of graphs of bounded tree-width in the Robertson Seymour t

A simpler proof of the Gieseker-Petri th

A simpler proof of the Gieseker-Petri theorem on special divisors

✍ D. Eisenbud; J. Harris 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 503 KB

Covering Radius of the Reed–Muller CodeR

Covering Radius of the Reed–Muller CodeR(1, 7)—A Simpler Proof

✍ Xiang-dong Hou 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 212 KB

A deep result about the Reed Muller codes, proved by Mykkeltveit in 1980, is that the covering radius of the Reed Muller code R(1, 7) equals 56. We discover an alternative and simpler proof for this important result.