✦ LIBER ✦

Growth and percolation on the uniform infinite planar triangulation

✍ Scribed by Omer Angel

Book ID: 105769011
Publisher: Springer
Year: 2003
Tongue: English
Weight: 381 KB
Volume: 13
Category: Article
ISSN: 1016-443X
DOI: 10.1007/s00039-003-0436-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Uniform Infinite Planar Triangulation an

Uniform Infinite Planar Triangulation and Related Time-Reversed Critical Branching Process

✍ M. A. Krikun 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 548 KB

On random planar graphs, the number of p

On random planar graphs, the number of planar graphs and their triangulations

✍ Deryk Osthus; Hans Jürgen Prömel; Anusch Taraz 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 219 KB

On the uniform convexity and uniform smo

On the uniform convexity and uniform smoothness of infinite-order Sobolev spaces

✍ A. N. Agadzhanov 📂 Article 📅 2007 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 171 KB

On information theory parameters of infi

On information theory parameters of infinite anti-uniform sources

✍ Esmaeili, M.; Kakhbod, A. 📂 Article 📅 2007 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 86 KB

On the max-cut problem for a planar, cub

On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation

✍ Carsten Thomassen 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 2 views

## Abstract Every 3‐connected planar, cubic, triangle‐free graph with __n__ vertices has a bipartite subgraph with at least 29__n__/24 − 7/6 edges. The constant 29/24 improves the previously best known constant 6/5 which was considered best possible because of the graph of the dodecahedron. Example

On a cluster category of infinite Dynkin

On a cluster category of infinite Dynkin type, and the relation to triangulations of the infinity-gon

✍ Thorsten Holm; Peter Jørgensen 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 French ⚖ 292 KB