乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T08:10:30Z","timestamp":1694160630716},"reference-count":24,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2020,7,26]],"date-time":"2020-07-26T00:00:00Z","timestamp":1595721600000},"content-version":"am","delay-in-days":366,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#am"},{"start":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T00:00:00Z","timestamp":1564099200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"name":"NSF","award":["DMS-1500121"]},{"name":"UIUC Campus Research Board","award":["15006"]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2020,1]]},"abstract":"Abstract<\/jats:title>An \u2010uniform linear cycle<\/jats:italic> of length , denoted by , is an \u2010graph with edges such that for every , and for all other pairs . For every and , we show that there exists a constant depending on and such that the number of linear \u2010graphs of girth is at most . Furthermore, we extend the result for , proving that there exists a constant depending on such that the number of linear \u2010graphs without is at most . The idea of the proof is to reduce the hypergraph enumeration problems to some graph enumeration problems, and then apply a variant of the graph container method, which may be of independent interest. We extend a breakthrough result of Kleitman and Winston on the number of \u2010free graphs, proving that the number of graphs containing at most 's is at most , for sufficiently large . We further show that for every and , the number of graphs such that each of its edges is contained in only cycles of length at most , is bounded by asymptotically.<\/jats:p>","DOI":"10.1002\/jgt.22477","type":"journal-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T09:19:36Z","timestamp":1564132776000},"page":"113-141","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the number of linear hypergraphs of large girth"],"prefix":"10.1002","volume":"93","author":[{"given":"J\u00f3zsef","family":"Balogh","sequence":"first","affiliation":[{"name":"Department of Mathematics University of Illinois at Urbana\u2010Champaign Urbana Illinois"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-5740-1612","authenticated-orcid":false,"given":"Lina","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Mathematics University of Illinois at Urbana\u2010Champaign Urbana Illinois"}]}],"member":"311","published-online":{"date-parts":[[2019,7,26]]},"reference":[{"key":"e_1_2_6_1_2_1","unstructured":"J.BaloghandL.Li On the number of generalized Sidon sets available athttps:\/\/arxiv.org\/abs\/1803.00659 preprint 2018."},{"key":"e_1_2_6_1_3_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-2014-00816-X"},{"key":"e_1_2_6_1_4_1","article-title":"The number of hypergraphs without linear cycles","author":"Balogh J.","year":"2018","journal-title":"J. Combin. Theory Ser. B"},{"key":"e_1_2_6_1_5_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.32.12.331"},{"key":"e_1_2_6_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90052-5"},{"key":"e_1_2_6_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548317000530"},{"key":"e_1_2_6_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788085"},{"key":"e_1_2_6_1_9_1","first-page":"203","volume-title":"Progress in Graph Theory","author":"Erd\u00f6s P.","year":"1984"},{"key":"e_1_2_6_1_10_1","unstructured":"R.FaudreeandM.Simonovits Cycle\u2010supersaturated graphs in preparation."},{"key":"e_1_2_6_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2013.12.009"},{"key":"e_1_2_6_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2017.12.015"},{"key":"e_1_2_6_1_13_1","unstructured":"T. Jiang and L. Yepremyan Supersaturation of even linear cycles in linear hypergraphs available athttps:\/\/arxiv.org\/abs\/1707.03091 preprint 2017."},{"key":"e_1_2_6_1_14_1","author":"Kleitman D. J.","year":"1996","journal-title":"On the number of graphs which lack small cycles"},{"key":"e_1_2_6_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90204-7"},{"key":"e_1_2_6_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009804"},{"key":"e_1_2_6_1_17_1","unstructured":"A. Kostochka D. Mubayi and J. Verstra\u00ebte Personal communication."},{"key":"e_1_2_6_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2014.09.005"},{"key":"e_1_2_6_1_19_1","unstructured":"B.Kreuter Extremale und asymptotische graphentheorie f\u00fcr verbotene bipartite untergraphen Ph.D. Thesis Diplomarbeit Forschungsinstitut f\u00fcr Diskrete Mathematik Universit\u00e4t Bonn 1994."},{"key":"e_1_2_6_1_20_1","doi-asserted-by":"publisher","DOI":"10.37236\/1718"},{"key":"e_1_2_6_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2016.05.001"},{"key":"e_1_2_6_1_22_1","unstructured":"D.MubayiandL.Wang The number of triple systems without even cycles available athttps:\/\/arxiv.org\/abs\/1701.00269 preprint 2017."},{"key":"e_1_2_6_1_23_1","unstructured":"C.Palmeret al. Tur\u00e1n numbers for Berge\u2010hypergraphs and related extremal problems available athttps:\/\/arxiv.org\/abs\/1706.04249 preprint 2017."},{"key":"e_1_2_6_1_24_1","first-page":"939","article-title":"Triple systems with no six points carrying three triangles","volume":"18","author":"Ruzsa I. Z.","year":"1978","journal-title":"Combinatorics"},{"key":"e_1_2_6_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00222-014-0562-8"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.22477","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.22477","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/jgt.22477","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/am-pdf\/10.1002\/jgt.22477","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.22477","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T10:26:18Z","timestamp":1694082378000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.22477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,26]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["10.1002\/jgt.22477"],"URL":"https:\/\/doi.org\/10.1002\/jgt.22477","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,26]]},"assertion":[{"value":"2017-09-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-05-27","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-07-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}