乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T17:21:38Z","timestamp":1719940898835},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001742","name":"USA\u2013Israel BSF","doi-asserted-by":"publisher","award":["2014361"],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["912\/12"],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1016\/j.ejc.2017.02.002","type":"journal-article","created":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T11:45:15Z","timestamp":1489146315000},"page":"26-43","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Waiter\u2013Client and Client\u2013Waiter Hamiltonicity games on random graphs"],"prefix":"10.1016","volume":"63","author":[{"given":"Dan","family":"Hefetz","sequence":"first","affiliation":[]},{"given":"Michael","family":"Krivelevich","sequence":"additional","affiliation":[]},{"given":"Wei En","family":"Tan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2017.02.002_br000005","series-title":"The Probabilistic Method","author":"Alon","year":"2008"},{"key":"10.1016\/j.ejc.2017.02.002_br000010","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s004930200009","article-title":"Positional games and the second moment method","volume":"22","author":"Beck","year":"2002","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2017.02.002_br000015","series-title":"Combinatorial Games: Tic-tac-toe Theory","volume":"vol. 114","author":"Beck","year":"2008"},{"key":"10.1016\/j.ejc.2017.02.002_br000020","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.tcs.2012.12.037","article-title":"On weight function methods in Chooser\u2013Picker games","volume":"475","author":"Bednarska-Bzd\u0229ga","year":"2013","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.ejc.2017.02.002_br000025","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1017\/S0963548315000310","article-title":"Manipulative waiters with probabilistic intuition","volume":"25","author":"Bednarska-Bzd\u0229ga","year":"2016","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.ejc.2017.02.002_br000030","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.jctb.2015.12.008","article-title":"Picker\u2013Chooser fixed graph games","volume":"119","author":"Bednarska-Bzd\u0229ga","year":"2016","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2017.02.002_br000035","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/rsa.20392","article-title":"Hitting time results for Maker\u2013Breaker games","volume":"41","author":"Ben-Shimon","year":"2012","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.ejc.2017.02.002_br000040","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/rsa.1019","article-title":"Avoiding a giant component","volume":"19","author":"Bohman","year":"2001","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.ejc.2017.02.002_br000045","series-title":"Graph Theory and Combinatorics","first-page":"35","article-title":"The evolution of sparse graphs","author":"Bollob\u00e1s","year":"1984"},{"key":"10.1016\/j.ejc.2017.02.002_br000050","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"2001"},{"issue":"1","key":"10.1016\/j.ejc.2017.02.002_br000055","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579198","article-title":"Threshold functions","volume":"7","author":"Bollob\u00e1s","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2017.02.002_br000060","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0167-5060(08)70335-2","article-title":"Biased positional games","volume":"2","author":"Chv\u00e1tal","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.ejc.2017.02.002_br000065","doi-asserted-by":"crossref","first-page":"3757","DOI":"10.1016\/j.tcs.2010.06.028","article-title":"The Picker\u2013Chooser diameter game","volume":"411","author":"Csernenszky","year":"2010","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.ejc.2017.02.002_br000070","doi-asserted-by":"crossref","first-page":"5141","DOI":"10.1016\/j.disc.2009.03.051","article-title":"On Chooser\u2013Picker positional games","volume":"309","author":"Csernenszky","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2017.02.002_br000075","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0097-3165(73)90005-8","article-title":"On a combinatorial game","volume":"14","author":"Erd\u0151s","year":"1973","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.ejc.2017.02.002_br000080","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1002\/rsa.20528","article-title":"Biased games on random graphs","volume":"46","author":"Ferber","year":"2015","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.ejc.2017.02.002_br000085","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","article-title":"Sharp thresholds of graph properties and the k-sat problem","volume":"12","author":"Friedgut","year":"1999","journal-title":"J. Amer. Math. Soc."},{"key":"10.1016\/j.ejc.2017.02.002_br000090","series-title":"Introduction to Random Graphs","author":"Frieze","year":"2016"},{"key":"10.1016\/j.ejc.2017.02.002_br000095","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s11856-008-1028-8","article-title":"On two Hamilton cycle problems in random graphs","volume":"166","author":"Frieze","year":"2008","journal-title":"Israel J. Math."},{"key":"10.1016\/j.ejc.2017.02.002_br000100","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1090\/S0002-9947-1963-0143712-1","article-title":"Regularity and positional games","volume":"106","author":"Hales","year":"1963","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.ejc.2017.02.002_br000105","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0012-365X(87)90138-5","article-title":"A solution to the box game","volume":"65","author":"Hamidoune","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2017.02.002_br000110","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1002\/rsa.20252","article-title":"A sharp threshold for the Hamilton cycle Maker\u2013Breaker game","volume":"34","author":"Hefetz","year":"2009","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.ejc.2017.02.002_br000115","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.jcta.2009.05.001","article-title":"Avoider\u2013Enforcer: The rules of the game","volume":"117","author":"Hefetz","year":"2010","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.ejc.2017.02.002_br000120","series-title":"Positional Games","author":"Hefetz","year":"2014"},{"key":"10.1016\/j.ejc.2017.02.002_br000125","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1016\/j.jcta.2006.10.001","article-title":"Avoider\u2013Enforcer games","volume":"114","author":"Hefetz","year":"2007","journal-title":"J. Combin. Theory Ser. A"},{"issue":"5","key":"10.1016\/j.ejc.2017.02.002_br000130","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s00493-009-2362-0","article-title":"Hamilton cycles in highly connected and expanding graphs","volume":"29","author":"Hefetz","year":"2009","journal-title":"Combinatorica"},{"issue":"5","key":"10.1016\/j.ejc.2017.02.002_br000135","doi-asserted-by":"crossref","first-page":"1525","DOI":"10.1016\/j.disc.2015.12.020","article-title":"Waiter\u2013Client and Client\u2013Waiter planarity, colorability and minor games","volume":"339","author":"Hefetz","year":"2016","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2017.02.002_br000140","series-title":"Random Graphs","author":"Janson","year":"2000"},{"key":"10.1016\/j.ejc.2017.02.002_br000145","unstructured":"F. Knox, Two constructions relating to conjectures of Beck on positional games, manuscript, arXiv:1212.3345."},{"issue":"1","key":"10.1016\/j.ejc.2017.02.002_br000150","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","article-title":"Limit distributions for the existence of Hamilton circuits in a random graph","volume":"43","author":"Koml\u00f3s","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2017.02.002_br000155","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/rsa.20254","article-title":"Avoiding small subgraphs in Achlioptas processes","volume":"34","author":"Krivelevich","year":"2009","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.ejc.2017.02.002_br000160","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/rsa.20302","article-title":"Hamiltonicity thresholds in Achlioptas processes","volume":"37","author":"Krivelevich","year":"2010","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.ejc.2017.02.002_br000165","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/rsa.20294","article-title":"Offline thresholds for Ramsey-type games on random graphs","volume":"36","author":"Krivelevich","year":"2010","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.ejc.2017.02.002_br000170","doi-asserted-by":"crossref","DOI":"10.37236\/794","article-title":"Biased positional games and small hypergraphs with large covers","volume":"15","author":"Krivelevich","year":"2008","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.ejc.2017.02.002_br000175","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1137\/0112059","article-title":"A solution of the Shannon switching game","volume":"12","author":"Lehman","year":"1964","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"4","key":"10.1016\/j.ejc.2017.02.002_br000180","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.jctb.2010.12.008","article-title":"Small subgraphs in random graphs and the power of multiple choices","volume":"101","author":"M\u00fctze","year":"2011","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2017.02.002_br000185","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","article-title":"Hamiltonian circuits in random graphs","volume":"14","author":"P\u00f3sa","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2017.02.002_br000190","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1002\/rsa.20059","article-title":"Positional games on random graphs","volume":"26","author":"Stojakovi\u0107","year":"2005","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.ejc.2017.02.002_br000195","series-title":"Introduction to Graph Theory","author":"West","year":"2001"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669817300094?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669817300094?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,19]],"date-time":"2022-06-19T20:35:13Z","timestamp":1655670913000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669817300094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":39,"alternative-id":["S0195669817300094"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2017.02.002","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2017,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Waiter\u2013Client and Client\u2013Waiter Hamiltonicity games on random graphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2017.02.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}