## Abstract We show that a maximal triangleโfree graph on __n__ vertices with minimum degree ฮด contains an independent set of 3ฮด โ __n__ vertices which have identical neighborhoods. This yields a simple proof that if the binding number of a graph is at least 3/2 then it has a triangle. This was con
A note on triangle-free quasi-symmetric designs
โ Scribed by Rajendra M. Pawale
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 84 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
โฆ Synopsis
Triangle-free quasi-symmetric 2-(v, k,k) designs with intersection numbers x, y; 01, are investigated. It is proved that k โฅ 2 yx -3. As a consequence it is seen that for fixed k, there are finitely many triangle-free quasi-symmetric designs. It is also proved that: k โค y( yx)+ x.
๐ SIMILAR VOLUMES
## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangleโfree __r__โregular graph are presented.
## Abstract Huffman and Tonchev discovered four nonโisomorphic quasiโsymmetric 2โ(49,9,6) designs. They arise from extremal selfโdual [50,25,10] codes with a certain weight enumerator. In this note, a new quasiโsymmetric 2โ(49,9,6) design is constructed. This is established by finding a new extrema
A blocking set of a design different from a 2-(ฮป+ 2, ฮป+ 1, ฮป) design has at least 3 points. The aim of this note is to establish which 2-(v, k, ฮป ) designs D with r โฅ 2ฮป may contain a blocking 3-set. The main results are the following. If D contains a blocking 3-set, then D is one of the following d