✦ LIBER ✦

Intersection Graphs for Families of Balls in Rn

✍ Scribed by Erdös, P.; Godsil, C.D.; Krantz, S.G.; Parsons, T.D.

Book ID: 122856115
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 410 KB
Volume: 9
Category: Article
ISSN: 0195-6698
DOI: 10.1016/S0195-6698(88)80007-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Intersection graphs of Helly families of

Intersection graphs of Helly families of subtrees

✍ Fǎnicǎ Gavril 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 964 KB

Intersection Theorems for Infinite Famil

Intersection Theorems for Infinite Families of Convex Sets in Graphs

✍ Norbert Polat 📂 Article 📅 1997 🏛 Springer Netherlands 🌐 English ⚖ 769 KB

Forbidden configurations in intersection

Forbidden configurations in intersection graphs of r-graphs

✍ M.L. Gardner 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 335 KB

Complexity of circuit intersection in gr

Complexity of circuit intersection in graphs

✍ Aviezri S. Fraenkel; Martin Loebl 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 819 KB

Nontrivial independent sets of bipartite

Nontrivial independent sets of bipartite graphs and cross-intersecting families

✍ Wang, Jun; Zhang, Huajun 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 265 KB

Inequalities for the Volume of the Unit

Inequalities for the Volume of the Unit Ball in Rn

✍ Horst Alzer 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 81 KB

Let ⍀ s r⌫ 1 q nr2 be the volume of the unit ball in R . We determine n the best possible constants a, b, A, B, ␣, and ␤ such that the inequalities . n n y1 nq1 are valid for all integers n G 1. Our results refine and complement inequalities proved by G. D. Anderson et al., K. H. Borgwardt, and D.