乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T06:42:01Z","timestamp":1720334521245},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T00:00:00Z","timestamp":1681776000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1016\/j.ipl.2023.106401","type":"journal-article","created":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T09:14:36Z","timestamp":1681982076000},"page":"106401","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Long paths in heterogeneous random subgraphs of graphs with large minimum degree"],"prefix":"10.1016","volume":"182","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-2817-3400","authenticated-orcid":false,"given":"Yilun","family":"Shang","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2023.106401_br0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579172","article-title":"The longest path in a random graph","volume":"1","author":"Ajtai","year":"1981","journal-title":"Combinatorica"},{"issue":"3","key":"10.1016\/j.ipl.2023.106401_br0020","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1002\/rsa.21067","article-title":"Cycle lengths in sparse random graphs","volume":"61","author":"Alon","year":"2022","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.ipl.2023.106401_br0030","series-title":"The Probabilistic Method","author":"Alon","year":"2016"},{"key":"10.1016\/j.ipl.2023.106401_br0040","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.jctb.2021.01.001","article-title":"A scaling limit for the length of the longest cycle in a sparse random graph","volume":"148","author":"Anastos","year":"2021","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.ipl.2023.106401_br0050","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1214\/aop\/1176994428","article-title":"A note on an inequality involving the normal distribution","volume":"9","author":"Chernoff","year":"1981","journal-title":"Ann. Probab."},{"key":"10.1016\/j.ipl.2023.106401_br0060","article-title":"Paths and cycles in random subgraphs of graphs with large minimum degree","volume":"25","author":"Ehard","year":"2018","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.ipl.2023.106401_br0070","first-page":"335","article-title":"Long paths in random graphs","volume":"14","author":"Fernandez de la Vega","year":"1979","journal-title":"Studia Sci. Math. Hung."},{"key":"10.1016\/j.ipl.2023.106401_br0080","series-title":"Introduction to Random Graphs","author":"Frieze","year":"2016"},{"key":"10.1016\/j.ipl.2023.106401_br0090","doi-asserted-by":"crossref","DOI":"10.1016\/j.spl.2019.108593","article-title":"Extremal paths in inhomogenous random graphs","volume":"156","author":"Ganesan","year":"2020","journal-title":"Stat. Probab. Lett."},{"key":"10.1016\/j.ipl.2023.106401_br0100","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","article-title":"Random graphs","volume":"30","author":"Gilbert","year":"1959","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/j.ipl.2023.106401_br0110","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1017\/S0963548316000237","article-title":"The threshold probability for long cycles","volume":"26","author":"Glebov","year":"2017","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.ipl.2023.106401_br0120","article-title":"Random perturbation of sparse graphs","volume":"28","author":"Hahn-Klimroth","year":"2021","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.ipl.2023.106401_br0130","doi-asserted-by":"crossref","first-page":"2942","DOI":"10.1137\/21M143488X","article-title":"Crux and long cycles in graphs","volume":"36","author":"Haslegrave","year":"2022","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.ipl.2023.106401_br0140","series-title":"Random Graphs","author":"Janson","year":"2000"},{"key":"10.1016\/j.ipl.2023.106401_br0150","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s00493-017-3701-1","article-title":"Long cycles in locally expanding graphs, with applications","volume":"39","author":"Krivelevich","year":"2019","journal-title":"Combinatorica"},{"key":"10.1016\/j.ipl.2023.106401_br0160","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1002\/rsa.20508","article-title":"Long paths and cycles in random subgraphs of graphs with large minimum degree","volume":"46","author":"Krivelevich","year":"2015","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.ipl.2023.106401_br0170","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1002\/rsa.20571","article-title":"Long cycles in random subgraphs of graphs with large minimum degree","volume":"45","author":"Riordan","year":"2014","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"10.1016\/j.ipl.2023.106401_br0180","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s13226-015-0119-6","article-title":"On the hamiltonicity of random bipartite graphs","volume":"46","author":"Shang","year":"2015","journal-title":"Indian J. Pure Appl. Math."},{"issue":"1","key":"10.1016\/j.ipl.2023.106401_br0190","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1017\/jpr.2022.32","article-title":"On connectivity and robustness of random graphs with inhomogeneity","volume":"60","author":"Shang","year":"2023","journal-title":"J. Appl. Probab."},{"issue":"9","key":"10.1016\/j.ipl.2023.106401_br0200","doi-asserted-by":"crossref","first-page":"78","DOI":"10.3792\/pjaa.98.015","article-title":"On the tree-depth and tree-width in heterogeneous random graphs","volume":"98","author":"Shang","year":"2022","journal-title":"Proc. Jpn. Acad., Ser. A, Math. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019023000443?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019023000443?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:38:47Z","timestamp":1684258727000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019023000443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":20,"alternative-id":["S0020019023000443"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2023.106401","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Long paths in heterogeneous random subgraphs of graphs with large minimum degree","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2023.106401","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"106401"}}