✦ LIBER ✦

Geometric Graphs with No Three Disjoint Edges

✍ Scribed by Jakub Cerny

Publisher: Springer
Year: 2005
Tongue: English
Weight: 233 KB
Volume: 34
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-005-1191-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Geometric Graphs with Few Disjoint Edges

✍ G. Tóth; P. Valtr 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 138 KB

Disjoint edges in geometric graphs

✍ N. Alon; P. Erdös 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 235 KB

Geometric graphs with no two parallel ed

Geometric graphs with no two parallel edges

✍ Rom Pinchasi 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 113 KB

On Geometric Graphs with No Two Edges in

On Geometric Graphs with No Two Edges in Convex Position

✍ M. Katchalski; H. Last 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 97 KB

On Geometric Graphs with NokPairwise Par

On Geometric Graphs with NokPairwise Parallel Edges

✍ P. Valtr 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 99 KB

Designs with no three mutually disjoint

Designs with no three mutually disjoint blocks

✍ A. Baartmans; Mohan Shrikhande 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 759 KB

Let D(u, b, r, k, A) be any quasi-symmetric block design with block intersection numbers 0 and y. Suppose D has no three mutually disjoint blocks. We show ttcat for a given value of y, there are only finitely many parameter sets of such designs. Moreover, the 'extremal' &signs D have one of the foll