✦ LIBER ✦

The number of edges of many faces in a line segment arrangement

✍ Scribed by B. Aronov; H. Edelsbrunner; L. J. Guibas; M. Sharir

Publisher: Springer-Verlag
Year: 1992
Tongue: English
Weight: 821 KB
Volume: 12
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01285815

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounding the number of k-faces in arrang

Bounding the number of k-faces in arrangements of hyperplanes

✍ Komei Fukuda; Shigemasa Saito; Akihisa Tamura; Takeshi Tokuyama 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 829 KB

The number of edges in a subgraph of a H

The number of edges in a subgraph of a Hamming graph

✍ R. Squier; B. Torrence; A. Vogt 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 363 KB

G be a subgraph of the Cartesian product Hamming graph (Kp)r with n vertices. Then the number of edges of G is at most (1/2)(p -1) log, n, with equality holding if and only G is isomorphic to (Kp)s for some s 5 r.

The number of edges in a maximum cycle—d

The number of edges in a maximum cycle—distributed graph

✍ Yongbing Shi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 288 KB

Shi, Y., The number of edges in a maximum cycle-distributed graph, Discrete Mathematics 104 (1992) 205-209. Let f(n) (f\*(n)) be the maximum possible number of edges in a graph (2-connected simple graph) on n vertices in which no two cycles prove that, for every integer n > 3, f(n) 3 n + k + [i( [~(

On the number of edges in the transitive

On the number of edges in the transitive closure of a graph

✍ W.F. McColl; K. Noshita 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 232 KB

The maximum number of edges in a minimal

The maximum number of edges in a minimal graph of diameter 2

✍ Zoltán Füredi 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 717 KB

## Abstract A graph __g__ of diameter 2 is minimal if the deletion of any edge increases its diameter. Here the following conjecture of Murty and Simon is proved for __n__ < __n__~o~. If __g__ has __n__ vertices then it has at most __n__^2^/4 edges. The only extremum is the complete bipartite graph

The maximum number of edges in a graph w

The maximum number of edges in a graph with fixed edge-degree

✍ R.J. Faudree; J. Sheehan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 633 KB

Suppose that n i> 2t + 2 (t/> 17). Let G be a graph with n vertices such that its complement is connected and, for all distinct non-adjacent vertices u and v, there are at least t common neighbours. Then we prove that and Furthermore, the results are sharp.