articles
55-61
research_article
false
http://link.springer.com/10.1007%2FBF02579177
2019-04-10T13:14
1981-03
https://scigraph.springernature.com/explorer/license/
Independence numbers of graphs and generators of ideals
This article investigates the generators of certain homogeneous ideals which are associated with graphs with bounded independence numbers. These ideals first appeared in the theory oft-designs. The main theorem suggests a new approach to the Clique Problem which isNP-complete. This theorem has a more general form in commutative algebra dealing with ideals associated with unions of linear varieties. This general theorem is stated in the article; a corollary to it generalizes Turán’s theorem on the maximum graphs with a prescribed clique number.
en
1981-03-01
dimensions_id
pub.1030969231
93892af8cd4b346b7528f33f499b04be1203b55e017d93b411b85629d4fb9b72
readcube_id
1
Li
Shuo-Yen Robert
Pure Mathematics
1
0209-9683
Combinatorica
1439-6912
Li
Wen-Ch’ing Winnie
Mathematical Sciences
doi
10.1007/bf02579177
Springer Nature - SN SciGraph project
Department of Mathematics, University of Illinois at Chicago Circle, 60680, Chicago, Illinois, USA
University of Illinois at Chicago