{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:34Z","timestamp":1720640854447},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80190-8","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T11:08:52Z","timestamp":1114945732000},"page":"295-298","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Subdivisions, linking, minors, and extremal functions"],"prefix":"10.1016","volume":"5","author":[{"given":"Andrew","family":"Thomason","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80190-8_BIB1","volume":"16","author":"Bollob\u00e0s","year":"1996","journal-title":"Highly linked graphs, Combinatorica"},{"key":"10.1016\/S1571-0653(05)80190-8_BIB2","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e0s P. Catlin and P. Erd\u00f6s, Hadwiger's conjecture is true for almost every graph, Europ. J. Combin. Theory, 1","DOI":"10.1016\/S0195-6698(80)80001-1"},{"key":"10.1016\/S1571-0653(05)80190-8_BIB3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02125347","article-title":"Quasi-random graphs","volume":"9","author":"Chung","year":"1989","journal-title":"Combinatorica."},{"key":"10.1016\/S1571-0653(05)80190-8_BIB4","first-page":"143","article-title":"On complete topological subgraphs of certain graphs","volume":"7","author":"Erd\u00f3s","year":"1964","journal-title":"Annales Univ. Sci. Budapest"},{"key":"10.1016\/S1571-0653(05)80190-8_BIB5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01350174","article-title":"Verallgemeinerung des n-fachen zusammenhangs f\u00fcr Graphen","volume":"187","author":"Jung","year":"1970","journal-title":"Math Ann."},{"key":"10.1016\/S1571-0653(05)80190-8_BIB6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1017\/S096354830000184X","article-title":"Topological cliques in graphs II","volume":"5","author":"Koml\u00f3s","year":"1996","journal-title":"Combinatorics, Probability and Computing"},{"key":"10.1016\/S1571-0653(05)80190-8_BIB7","first-page":"37","article-title":"The minimum Hadwiger number for graphs with a given mean degree of vertices (in Russian)","volume":"38","author":"Kostochka","year":"1982","journal-title":"Metody Diskret. Analiz."},{"key":"10.1016\/S1571-0653(05)80190-8_BIB8","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1112\/plms\/s3-20.1.144","article-title":"On the existence of certain congurations within graphs and the 1-skeletons of polytopes","volume":"20","author":"Larman","year":"1974","journal-title":"Proc London Math. Soc."},{"key":"10.1016\/S1571-0653(05)80190-8_BIB9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01364272","article-title":"Homomorphieeigenschaften und mittlere Kantendichte von Graphen","volume":"174","author":"Mader","year":"1976","journal-title":"Math. Annalen"},{"key":"10.1016\/S1571-0653(05)80190-8_BIB10","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/BF01350657","article-title":"Homomorphiesatze f\u00fcr Graphen","volume":"178","author":"Mader","year":"1968","journal-title":"Math. Ann."},{"key":"10.1016\/S1571-0653(05)80190-8_BIB11","first-page":"569","volume":"18","author":"Mader","year":"1998","journal-title":"3n-5; edges do force a subdivision of K5, Combinatorica"},{"key":"10.1016\/S1571-0653(05)80190-8_BIB12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1090\/dimacs\/049\/14","article-title":"Topological minors in graphs of minimum degree n","volume":"49","author":"Mader","year":"1999","journal-title":"DIMACS series in Disc. Math. And Theor Comp. Sci"},{"key":"10.1016\/S1571-0653(05)80190-8_BIB13","unstructured":"W. Mader, personal communication."},{"key":"10.1016\/S1571-0653(05)80190-8_BIB14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","article-title":"Graph Minors. XIII The disjoin tpaths problem","volume":"63","author":"Robertson","year":"1995","journal-title":"J Combin. Theory Ser. B"},{"key":"10.1016\/S1571-0653(05)80190-8_BIB15","first-page":"307","article-title":"Pseudo-random graphs, in \u201cRandom Graphs '85\u201d","volume":"33","author":"Thomason","year":"1978"},{"key":"10.1016\/S1571-0653(05)80190-8_BIB16","doi-asserted-by":"crossref","unstructured":"A. Thomason, The extremal function for complete minors, (submitted to J. Combinatorial Th.(Ser B)).","DOI":"10.1006\/jctb.2000.2013"},{"key":"10.1016\/S1571-0653(05)80190-8_BIB17","unstructured":"A. Thomason Complete minors in pseudo-random graphs, (to appear in Random Structures and Algorithms)."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801908?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801908?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T05:18:02Z","timestamp":1586236682000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":17,"alternative-id":["S1571065305801908"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80190-8","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}