✦ LIBER ✦

Lower Bounds for Simplicial Covers and Triangulations of Cubes

✍ Scribed by Adam Bliss; Francis Edward Su

Publisher: Springer
Year: 2004
Tongue: English
Weight: 261 KB
Volume: 33
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-004-1128-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds for thecd-index of Odd-dime

Lower Bounds for thecd-index of Odd-dimensional Simplicial Manifolds

✍ Isabella Novik 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

Lower bounds for coverings of pairs by l

Lower bounds for coverings of pairs by large blocks

✍ D. T. Todorov 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 402 KB

Lower Bounds for Equilibria of Covering

Lower Bounds for Equilibria of Covering Flows on Manifolds

✍ L. A. Luxemburg 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 533 KB

A Lower Bound for the Simplexity of then

A Lower Bound for the Simplexity of then-Cube via Hyperbolic Volumes

✍ Warren D. Smith 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 139 KB

Let T (n) denote the number of n-simplices in a minimum cardinality decomposition of the n-cube into n-simplices. For n ≥ 1, we show that T (n) ≥ H (n), where H (n) is the ratio of the hyperbolic volume of the ideal cube to the ideal regular simplex. Explicit bounds for T (n) are tabulated for n ≤

Lower bounds for q-ary coverings by sphe

Lower bounds for q-ary coverings by spheres of radius one

✍ Laurent Habsieger 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 876 KB

New Lower Bounds for Ramsey Numbers of G

New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs

✍ Felix Lazebnik; Dhruv Mubayi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 146 KB 👁 1 views

## dedicated to the memory of rodica simion Let G be an r-uniform hypergraph. The multicolor Ramsey number r k G is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K r n yields a monochromatic copy of G. Improving slightly upon results from M. Axenovich,