𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On graphs with at most four line-disjoint paths connecting any two vertices

✍ Scribed by John L Leonard

Publisher
Elsevier Science
Year
1972
Tongue
English
Weight
507 KB
Volume
13
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximal size of graphs with at most
The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices
✍ Mao-cheng Cai 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 502 KB

Let n and k be positive integers satisfying k + 1 s n s 3k -1, and G a simple graph of order n and size e(G) with at most k edge-disjoint paths connecting any two adjacent vertices. In this paper we prove that e(G) s l(n + k)\*/8], and give complete characterizations of the extremal graphs and the e

On the density of 2-colorable 3-graphs i
On the density of 2-colorable 3-graphs in which any four points span at most two edges
✍ Klas Markström; John Talbot 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 1 views

## Abstract Let __ex__~2~(__n, K__) be the maximum number of edges in a 2‐colorable __K__‐free 3‐graph (where __K__={123, 124, 134} ). The 2‐chromatic Turán density of __K__ is \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$\pi\_{2}({K}\_{4}^-) =lim\_{{n}\to \infty} {ex}\_{2}