๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The triangle intersection problem for designs

โœ Scribed by Yanxun Chang; Tao Feng; Giovanni Lo Faro

Book ID
108114180
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
380 KB
Volume
310
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The intersection problem for star design
The intersection problem for star designs
โœ Elizabeth J. Billington; D.G. Hoffman ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 266 KB
The intersection problem for K4 - e desi
The intersection problem for K4 - e designs
โœ Elizabeth J. Billington; M. Gionfriddo; C.C. Lindner ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 886 KB

A G-design of order n is a pair (P,B) where P is the vertex set of the complete graph Kn and B is an edge-disjoint decomposition of Kn into copies of the simple graph G. Following design terminology, we call these copies "blocks". Here/ยฃ4 -e denotes the complete graph K4 with one edge removed. It is

Extremal Graphs for Intersecting Triangl
Extremal Graphs for Intersecting Triangles
โœ P. Erdos; Z. Furedi; R.J. Gould; D.S. Gunderson ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 400 KB

It is known that for a graph on \(n\) vertices \(\left\lfloor n^{2} / 4\right\rfloor+1\) edges is sufficient for the existence of many triangles. In this paper, we determine the minimum number of edges sufficient for the existence of \(k\) triangles intersecting in exactly one common vertex. C 1995