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

An application of intersection diagrams of high rank

โœ Scribed by K. Nomura


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
286 KB
Volume
127
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis


We have obtained several results on distance-regular graphs by using intersection diagrams with respect to adjacent vertices. In this paper, we give an application of the intersection diagram with respect to nonadjacent vertices.


๐Ÿ“œ SIMILAR VOLUMES


On the intersection rank of a graph
โœ James A. Wiseman ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 748 KB

Wiseman, J.A., On the intersection rank of a graph, Discrete Mathematics 104 293-305.

An intersection theorem for systems of s
โœ A. V. Kostochka ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 346 KB ๐Ÿ‘ 2 views

Erdos and Rado defined a A-system, as a family in which every two members have the same intersection. Here we obtain a new upper bound on the maximum cardinality q ( n , q ) of an n-uniform family not containing any A-system of cardinality q. Namely, we prove that, for any a > 1 and q , there exists