{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:23Z","timestamp":1759637543779,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319497860"},{"type":"electronic","value":"9783319497877"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49787-7_12","type":"book-chapter","created":{"date-parts":[[2016,11,10]],"date-time":"2016-11-10T01:03:35Z","timestamp":1478739815000},"page":"140-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Subgraphs in Non-uniform Random Hypergraphs"],"prefix":"10.1007","author":[{"given":"Megan","family":"Dewar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Healy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"P\u00e9rez-Gim\u00e9nez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Pra\u0142at","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Proos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Reiniger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirill","family":"Ternovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,11]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/B:CMOT.0000032580.12184.c0","volume":"10","author":"M Alexander","year":"2004","unstructured":"Alexander, M., Robins, G.: Small worlds among interlocking directors: network structures and distance in bipartite graphs. Comput. Math. Org. Theor. 10(1), 69\u201394 (2004)","journal-title":"Comput. Math. Org. Theor."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bahmanian, M., Sajna, M.: Connection, separation in hypergraphs (2015). arXiv:1504.04274v1","DOI":"10.20429\/tag.2015.020205"},{"key":"12_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge University Press, Cambridge (2001)"},{"key":"12_CR4","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1017\/CBO9780511662157.006","volume-title":"Combinatorics","author":"B Bollob\u00e1s","year":"1981","unstructured":"Bollob\u00e1s, B.: Random graphs. In: Temperley, H.N.V. (ed.) Combinatorics. London Mathematical Society Lecture Note Series, vol. 52, pp. 80\u2013102. Cambridge University Press, Cambridge (1981)"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0378-8733(96)00301-2","volume":"19","author":"S Borgatti","year":"1997","unstructured":"Borgatti, S., Everett, M.: Network analysis of 2-mode data. Soc. Netw. 19(3), 243\u2013269 (1997)","journal-title":"Soc. Netw."},{"key":"12_CR6","volume-title":"Handbook of Combinatorics","author":"P Duchet","year":"1995","unstructured":"Duchet, P.: Hypergraphs. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics. Elsevier, Amsterdam (1995)"},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"P48","DOI":"10.37236\/535","volume":"17","author":"A Dudek","year":"2011","unstructured":"Dudek, A., Frieze, A.M.: Loose Hamilton cycles in random $$k$$ k -uniform hypergraphs. Electron. J. Comb. 17, P48 (2011)","journal-title":"Electron. J. Comb."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1002\/rsa.20404","volume":"42","author":"A Dudek","year":"2012","unstructured":"Dudek, A., Frieze, A.M.: Tight Hamilton cycles in random uniform hypergraphs. Random Struct. Algorithms 42, 374\u2013385 (2012)","journal-title":"Random Struct. Algorithms"},{"key":"12_CR9","unstructured":"Ferber, A.: Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs (preprint)"},{"key":"12_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316339831","volume-title":"Introduction to Random Graphs","author":"AM Frieze","year":"2015","unstructured":"Frieze, A.M., Karo\u0144ski, M.: Introduction to Random Graphs. Cambridge University Press, Cambridge (2015)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/11558989_18","volume-title":"Peer-to-Peer Systems IV","author":"S Blond Le","year":"2005","unstructured":"Le Blond, S., Guillaume, J.-L., Latapy, M.: Clustering in P2P exchanges and consequences on performances. In: Castro, M., Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 193\u2013204. Springer, Heidelberg (2005). doi: 10.1007\/11558989_18"},{"key":"12_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. Wiley, New York (2000)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.20224","volume":"33","author":"A Johansson","year":"2008","unstructured":"Johansson, A., Kahn, J., Vu, V.: Factor in random graphs. Random Struct. Algorithms 33, 1\u201328 (2008)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.socnet.2007.04.006","volume":"30","author":"M Latapy","year":"2008","unstructured":"Latapy, M., Magnien, C., Del Vecchio, N.: Basic notions for the analysis of large two-mode networks. Soc. Netw. 30(1), 31\u201348 (2008)","journal-title":"Soc. Netw."},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1186\/1471-2105-12-132","volume":"12","author":"W Zhou","year":"2011","unstructured":"Zhou, W., Nakhleh, L.: Properties of metabolic graphs: biological organization or representation artifacts? BMC Bioinform. 12, 132 (2011)","journal-title":"BMC Bioinform."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49787-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T00:05:41Z","timestamp":1657670741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49787-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319497860","9783319497877"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49787-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"11 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Models for the Web-Graph","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waw2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.math.ryerson.ca\/waw2016\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}