{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T15:20:48Z","timestamp":1777562448465,"version":"3.51.4"},"reference-count":10,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4911,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1993,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Giving a partial solution to a conjecture of Balas and Yu [<jats:italic>Networks<\/jats:italic> <jats:bold>19<\/jats:bold> (1989) 247\u2013235], we prove that if the complement of a graph <jats:italic>G<\/jats:italic> on <jats:italic>n<\/jats:italic> vertices contains no set of <jats:italic>t<\/jats:italic> + 1 pairwise disjoint edges as an induced subgraph, then <jats:italic>G<\/jats:italic> has fewer than (<jats:italic>n<\/jats:italic>\/2<jats:italic>t<\/jats:italic>)<jats:sup>2<jats:italic>t<\/jats:italic><\/jats:sup> maximal complete subgraphs. \u00a9 <jats:italic>1993 by John Wiley &amp; Sons, Inc.<\/jats:italic><\/jats:p>","DOI":"10.1002\/net.3230230308","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T14:21:58Z","timestamp":1178979718000},"page":"207-210","source":"Crossref","is-referenced-by-count":38,"title":["An upper bound on the number of cliques in a graph"],"prefix":"10.1002","volume":"23","author":[{"given":"Martin","family":"Farber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mih\u00e1ly","family":"Hujter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190206"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02992818"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(89)90268-9"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190110403"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(88)90114-8"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90077-9"},{"key":"e_1_2_1_8_2","unstructured":"M.HujterandZs.Tuza The number of maximal independent sets in triangle\u2010free graphs SIAM J. Disc. Math in print."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760024"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1137\/0401012"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1137\/0607015"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230230308","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230230308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T13:14:48Z","timestamp":1698239688000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230230308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["10.1002\/net.3230230308"],"URL":"https:\/\/doi.org\/10.1002\/net.3230230308","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}