✦ LIBER ✦

General Lower Bounds for the Minor Crossing Number of Graphs

✍ Scribed by Drago Bokal; Éva Czabarka; László A. Székely; Imrich Vrt’o

Publisher: Springer
Year: 2010
Tongue: English
Weight: 514 KB
Volume: 44
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-010-9245-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lower Bound for the Rectilinear Crossi

A Lower Bound for the Rectilinear Crossing Number

✍ Bernardo M. Ábrego; Silvia Fernández-Merchant 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 107 KB

New Lower Bounds for the Number of (≤ k)

New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn

✍ Oswin Aichholzer; Jesus Garcia; David Orden; Pedro Ramos 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 213 KB

A lower bound for the convexity number o

A lower bound for the convexity number of some graphs

✍ Byung Kee Kim 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 135 KB

Bounding the crossing number of a graph

Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree

✍ Enrique Garcia-Moreno; Gelasio Salazar 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 76 KB 👁 3 views

A lower bound for the independence numbe

A lower bound for the independence number of a planar graph

✍ Michael O Albertson 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 403 KB

New Lower Bounds for Ramsey Numbers of G

New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs

✍ Felix Lazebnik; Dhruv Mubayi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 146 KB 👁 1 views

## dedicated to the memory of rodica simion Let G be an r-uniform hypergraph. The multicolor Ramsey number r k G is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K r n yields a monochromatic copy of G. Improving slightly upon results from M. Axenovich,