ICAR Research Data Repository for Knowledge Management
The Binomial k-Clique
DSpace at IIT Bombay
View Archive Info| Field | Value | |
| Title |
The Binomial k-Clique
|
|
| Creator |
NARAYANA, NS
SANE, S |
|
| Subject |
clique
maximal k-clique binomial clique projective plane hypergraph uniform hypergeraph MAXIMAL INTERSECTING FAMILIES FINITE SETS RANK |
|
| Description |
A finite collection C of k-sets, where k=2, is called a k-clique if every two k-sets (called lines) in C have a nonempty intersection and a k-clique is a called a maximal k-clique if |C|
|
|
| Publisher |
WILEY-BLACKWELL
|
|
| Date |
2014-10-15T14:19:17Z
2014-10-15T14:19:17Z 2013 |
|
| Type |
Article
|
|
| Identifier |
JOURNAL OF COMBINATORIAL DESIGNS, 21(1)36-45
http://dx.doi.org/10.1002/jcd.21333 http://dspace.library.iitb.ac.in/jspui/handle/100/15085 |
|
| Language |
en
|
|