✦ LIBER ✦

On edges crossing few other edges in simple topological complete graphs

✍ Scribed by Jan Kynčl; Pavel Valtr

Book ID: 108114019
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 723 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.03.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Disjoint Edges in Complete Topological G

Disjoint Edges in Complete Topological Graphs

✍ Andrew Suk 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 183 KB

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

Edges without crossings in drawings of c

Edges without crossings in drawings of complete graphs

✍ Heiko Harborth; Ingrid Mengersen 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 595 KB

Exact two-point resistance, and the simp

Exact two-point resistance, and the simple random walk on the complete graph minus edges

✍ Noureddine Chair 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 267 KB

On the number of edge-disjoint one facto

On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs

✍ D.G. Hoffman; C.A. Rodger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 503 KB

In this paper we use Tutte's f-factor theorem and the method of amalgamations to find necessary and sufficient conditions for the existence of a k-factor in the complete multipartite graph K(p(1 ) ..... p(n)), conditions that are reminiscent of the Erd6s-Gallai conditions for the existence of simple