✦ LIBER ✦

The Number of Large Graphs with a Positive Density of Triangles

✍ Scribed by P. Collet; J.-P. Eckmann

Book ID: 110396080
Publisher: Springer
Year: 2002
Tongue: English
Weight: 160 KB
Volume: 109
Category: Article
ISSN: 0022-4715
DOI: 10.1023/a:1020489507547

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Triangle-free intersection graphs of lin

Triangle-free intersection graphs of line segments with large chromatic number

✍ Pawlik, Arkadiusz; Kozik, Jakub; Krawczyk, Tomasz; Lasoń, Michał; Micek, Piotr; 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Competition numbers of graphs with a sma

Competition numbers of graphs with a small number of triangles

✍ Suh-Ryung Kim; Fred S. Roberts 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 722 KB

If D is an acyclic digraph, its competition graph is an undirected graph with the same vertex set and an edge between vertices x and y if there is a vertex a so that (x, a) and (y, a) are both arcs of D. If G is any graph, G together with sufficiently many isolated vertices is a competition graph, a

Prime graphs of finite groups with a sma

Prime graphs of finite groups with a small number of triangles

✍ Tong-Viet, Hung P. 📂 Article 📅 2013 🏛 Springer Vienna 🌐 English ⚖ 688 KB

On the Chromatic Number of Triangle-Free

On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree

✍ Carsten Thomassen 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 117 KB

The fractional chromatic number of trian

The fractional chromatic number of triangle-free graphs with

✍ Linyuan Lu; Xing Peng 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 498 KB

On the maximal number of independent tri

On the maximal number of independent triangles in graphs

✍ G. A. Dirac 📂 Article 📅 1963 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 273 KB