✦ LIBER ✦

The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges

✍ Scribed by Eyal Ackerman, Noa Nitzan, Rom Pinchasi

Book ID: 120788870
Publisher: Springer Japan
Year: 2013
Tongue: English
Weight: 263 KB
Volume: 30
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-013-1335-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Maximum Number of Edges in Topolo

On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges

✍ Eyal Ackerman 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 579 KB

Maximum number of edges in connected gra

Maximum number of edges in connected graphs with a given domination number

✍ Laura A. Sanchis 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Sanchis, L.A., Maximum number of edges in connected graphs with a given domination number, Discrete Mathematics 87 (1991) 65-72.

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.

On the maximum number of independent edg

On the maximum number of independent edges in cubic graphs

✍ Arthur M. Hobbs; Edward Schmeichel 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Let the reals be extended to include oo with o~ > r

On the Number of Edges in Geometric Grap

On the Number of Edges in Geometric Graphs Without Empty Triangles

✍ C. Bautista-Santiago, M. A. Heredia, C. Huemer… 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 254 KB

The maximum number of edges in 2K2-free

The maximum number of edges in 2K2-free graphs of bounded degree

✍ F.R.K. Chung; A. Gyárfás; Z. Tuza; W.T. Trotter 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 481 KB

A graph is 2K,-free if it does not contain an independent pair of edges as an induced subgraph. We show that if G is 2K,-free and has maximum degree A(G) = D, then G has at most 5D2/4 edges if D is even. If D is odd, this bound can be improved to (5D\* -20 + 1)/4. The extremal graphs are unique.