✦ LIBER ✦

Packing and Covering Triangles in Tripartite Graphs

✍ Scribed by Sarmad Abbasi

Publisher: Springer Japan
Year: 1998
Tongue: English
Weight: 91 KB
Volume: 14
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730050010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Packing and Covering Triangles in Planar

Packing and Covering Triangles in Planar Graphs

✍ Qing Cui; Penny Haxell; Will Ma 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 228 KB

Packing triangles in bounded degree grap

Packing triangles in bounded degree graphs

✍ Alberto Caprara; Romeo Rizzi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 103 KB

We consider the two problems of finding the maximum number of node disjoint triangles and edge disjoint triangles in an undirected graph. We show that the first (respectively second) problem is polynomially solvable if the maximum degree of the input graph is at most 3 (respectively 4), whereas it i

Packing and covering dense graphs

✍ Noga Alon; Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB 👁 1 views

Covering and packing in graphs IV: Linea

Covering and packing in graphs IV: Linear arboricity

✍ Jin Akiyama; Geoffrey Exoo; Frank Harary 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

Packing triangles in a graph and its com

Packing triangles in a graph and its complement

✍ Peter Keevash; Benny Sudakov 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB 👁 1 views

## Abstract How few edge‐disjoint triangles can there be in a graph __G__ on __n__ vertices and in its complement $\overline {G}$? This question was posed by P. Erdős, who noticed that if __G__ is a disjoint union of two complete graphs of order __n__/2 then this number is __n__^2^/12 + __o__(__n__