{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T11:38:03Z","timestamp":1773401883053,"version":"3.50.1"},"reference-count":22,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":4721,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1993,11]]},"abstract":"Abstract<\/jats:title>We derive bounds for f(v)<\/jats:italic>, the maximum number of edges in a graph on v<\/jats:italic> vertices that contains neither three\u2010cycles nor four\u2010cycles. Also, we give the exact value of f(v)<\/jats:italic> for all v<\/jats:italic> up to 24 and constructive lower bounds for all v<\/jats:italic> up to 200. \u00a9 1993 John Wiley & Sons, Inc.<\/jats:p>","DOI":"10.1002\/jgt.3190170511","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T13:24:09Z","timestamp":1180185849000},"page":"633-645","source":"Crossref","is-referenced-by-count":36,"title":["Extremal graphs without three\u2010cycles or four\u2010cycles"],"prefix":"10.1002","volume":"17","author":[{"given":"David K.","family":"Garnick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y. H. Harris","family":"Kwong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Lazebnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Extremal Graph Theory","author":"Bollob\u00e1s B.","year":"1978"},{"key":"e_1_2_1_3_2","unstructured":"J. A.Bondy P.Erd\u00f6s andS.Fajtlowicz Graphs of diameter two with no 4\u2010cycles. Research Report CORR 79\/11 Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario Canada March 29 (1979)."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1966-036-2"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130107"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01787638"},{"key":"e_1_2_1_7_2","first-page":"3","article-title":"Some recent progress on extremal problems in graph theory","volume":"14","author":"Erd\u00f6s P.","year":"1975","journal-title":"Congres. Numer."},{"key":"e_1_2_1_8_2","first-page":"215","article-title":"On a problem of graph theory","volume":"1","author":"Erd\u00f6s P.","year":"1966","journal-title":"Studia Sci. Math. Hung."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90018-7"},{"key":"e_1_2_1_10_2","unstructured":"Z.F\u00fcredi Quadrilateral\u2010free graphs with maximum number of edges. Preprint."},{"key":"e_1_2_1_11_2","unstructured":"D. K.Garnick Y. H.Kwong andF.Lazebnik Graphs without three\u2010cycles or four\u2010cycles for each order from 25 to 200. Computer Science Research Report 91\u20102 Bowdoin College Brunswick ME (1991)."},{"key":"e_1_2_1_12_2","unstructured":"D. K.Garnick Y. H.Kwong andF.Lazebnik Algorithmic search for extremal graphs of girth five. Preprint."},{"key":"e_1_2_1_13_2","unstructured":"D. K.Garnick Y. H.Kwong andF.Lazebnik Extremal graphs of girth five. Research Report 93\u20101 Department of Mathematical Sciences University of Delaware Newark DE February (1993)."},{"key":"e_1_2_1_14_2","first-page":"33","article-title":"Non\u2010isomorphic extremal graphs without three\u2010cycles or four\u2010cycles","volume":"12","author":"Garnick D. K.","year":"1992","journal-title":"J. Combinat. Math. Combin. Comput."},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.45.0497"},{"key":"e_1_2_1_16_2","first-page":"79","article-title":"A combinatorial proof that the Moore (7,2) graph is unique","volume":"5","author":"James L. O.","year":"1974","journal-title":"Util. Math."},{"key":"e_1_2_1_17_2","unstructured":"B. D.McKay Isomorph\u2010free exhaustive generation. Preprint."},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1964-11250-7"},{"key":"e_1_2_1_19_2","first-page":"423","article-title":"Structure of the Hoffman\u2010Singleton graph","volume":"13","author":"Schwenk A. J.","year":"1992","journal-title":"Abstr. Papers AMS"},{"key":"e_1_2_1_20_2","volume-title":"Selected Topics in Graph Theory","author":"Simonovits M.","year":"1983"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.2307\/2315106"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90116-5"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060103"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190170511","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190170511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T07:59:00Z","timestamp":1698307140000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190170511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["10.1002\/jgt.3190170511"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190170511","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}