✦ LIBER ✦

Dynkin graphs, Gabrielov graphs, and triangle singularities

✍ Scribed by T. Urabe

Publisher: Springer US
Year: 1996
Tongue: English
Weight: 473 KB
Volume: 82
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf02362581

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bifurcations, Dynkin diagrams, and modal

Bifurcations, Dynkin diagrams, and modality of isolated singularities

✍ A. M. Gabriélov 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 462 KB

Curve singularities and graphs

✍ Yang Jingen 📂 Article 📅 1990 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 557 KB

Toughness and Triangle-Free Graphs

✍ D. Bauer; J. Vandenheuvel; E. Schmeichel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 520 KB

Once again on polyhedral groups and Dynk

Once again on polyhedral groups and Dynkin graphs

✍ S.V Tsaranov 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 705 KB

On triangle-free random graphs

✍ Tomasz Łuczak 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 3 views

We show that for every k ≥ 1 and δ > 0 there exists a constant c > 0 such that, with probability tending to 1 as n → ∞, a graph chosen uniformly at random among all triangle-free graphs with n vertices and M ≥ cn 3/2 edges can be made bipartite by deleting δM edges. As an immediate consequence of th

Packing and covering triangles in graphs

✍ P.E. Haxell 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 184 KB

It is shown that if G is a graph such that the maximum size of a set of pairwise edge-disjoint triangles is v(G), then there is a set C of edges of G of size at most (3 -e)v(G) such that E(T) N C 7~ 0 for every triangle T of G, where e> 3. This is the first nontrivial bound known for a long-standing