✦ LIBER ✦

Unavoidable Configurations in Complete Topological Graphs

✍ Scribed by János Pach; József Solymosi; Géza Tóth

Publisher: Springer
Year: 2003
Tongue: English
Weight: 132 KB
Volume: 30
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-003-0012-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unavoidable cycle lengths in graphs

✍ Jacques Verstraete 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

## Abstract An old conjecture of Erdős states that there exists an absolute constant __c__ and a set __S__ of density zero such that every graph of average degree at least __c__ contains a cycle of length in __S__. In this paper, we prove this conjecture by showing that every graph of average degre

Unavoidable stars in 3-graphs

✍ F.R.K. Chung 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 403 KB

Topological Ramsey Theorem for Complete

Topological Ramsey Theorem for Complete Bipartite Graphs

✍ M.S. Miyauchi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 645 KB

Small topological complete subgraphs of

Small topological complete subgraphs of “dense” graphs

✍ A. Kostochka; L. Pyber 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 153 KB

Simple Realizability of Complete Abstrac

Simple Realizability of Complete Abstract Topological Graphs in P

✍ Jan Kynčl 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 460 KB

On unavoidable digraphs in orientations

On unavoidable digraphs in orientations of graphs

✍ Gary S. Bloom; Stefan A. Burr 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 480 KB