{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T07:49:12Z","timestamp":1768808952275,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,2,8]],"date-time":"2014-02-08T00:00:00Z","timestamp":1391817600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s00493-014-2806-z","type":"journal-article","created":{"date-parts":[[2014,2,8]],"date-time":"2014-02-08T06:33:01Z","timestamp":1391841181000},"page":"279-298","source":"Crossref","is-referenced-by-count":33,"title":["A minimum degree condition forcing complete graph immersion"],"prefix":"10.1007","volume":"34","author":[{"given":"Matt","family":"Devos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zden\u011bk","family":"Dvo\u0159\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"Fox","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jessica","family":"McDonald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Scheide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,8]]},"reference":[{"key":"2806_CR1","unstructured":"F. N. Abu-Khzam and M. A. Langston: Graph coloring and the immersion order, preprint."},{"key":"2806_CR2","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1017\/S0963548303005741","volume":"12","author":"N Alon","year":"2003","unstructured":"N. Alon, M. Krivelevich, B. Sudakov: Tur\u00e1n numbers of bipartite graphs and related Ramsey-type questions, Combin. Probab. Comput. 12 (2003), 477\u2013494.","journal-title":"Combin. Probab. Comput."},{"key":"2806_CR3","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1006\/eujc.1997.0188","volume":"19","author":"B Bollob\u00e1s","year":"1998","unstructured":"B. Bollob\u00e1s, A. Thomason: Proof of a conjecture of Mader, Erd\u0151s and Hajnal on topological complete subgraphs, European J. Combin. 19 (1998), 883\u2013887.","journal-title":"European J. Combin."},{"key":"2806_CR4","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1006\/jagm.1998.0991","volume":"30","author":"H D Booth","year":"1999","unstructured":"H. D. Booth, R. Govindan, M. A. Langston and S. Ramachandramurthis: Sequential and parallel algorithms for K4-immersion testing, J. Algorithms 30 (1999), 344\u2013378.","journal-title":"J. Algorithms"},{"key":"2806_CR5","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0012-365X(78)90049-3","volume":"22","author":"P A Catlin","year":"1978","unstructured":"P. A. Catlin: A bound on the chromatic number of a graph, Discrete Math. 22 (1978), 81\u201383.","journal-title":"Discrete Math."},{"key":"2806_CR6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.26493\/1855-3974.112.b74","volume":"3","author":"M DeVos","year":"2010","unstructured":"M. DeVos, K. Kawarabayashi, B. Mohar and H. Okamura: Immersing small complete graphs, Ars Math. Contemp. 3 (2010), 139\u2013146.","journal-title":"Ars Math. Contemp."},{"key":"2806_CR7","series-title":"Proc. Conf. Waterloo, 1977","first-page":"153","volume-title":"Graph Theory and Related Topics","author":"P Erd\u0151s","year":"1979","unstructured":"P. Erd\u0151s: Problems and results in graph theory and combinatorial analysis, in: Graph Theory and Related Topics (Proc. Conf. Waterloo, 1977), Academic Press, New York, 1979, 153\u2013163."},{"key":"2806_CR8","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1145\/44483.44491","volume":"35","author":"M R Fellows","year":"1998","unstructured":"M. R. Fellows and M. A. Langston: Nonconstructive tools for proving polynomial-time decidability, J. ACM 35 (1998), 727\u2013738.","journal-title":"J. ACM"},{"key":"2806_CR9","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1002\/rsa.20344","volume":"38","author":"J Fox","year":"2011","unstructured":"J. Fox and B. Sudakov: Dependent random choice, Random Structures and Algorithms 38 (2011), 68\u201399.","journal-title":"Random Structures and Algorithms"},{"key":"2806_CR10","first-page":"133","volume":"88","author":"H Hadwiger","year":"1943","unstructured":"H. Hadwiger: \u00dcber eine Klassi kation der Streckenkomplexe, Vierteljahrsschr. Naturforsch. Ges. Z\u00fcrich 88 (1943), 133\u2013142.","journal-title":"Vierteljahrsschr. Naturforsch. Ges. Z\u00fcrich"},{"key":"2806_CR11","first-page":"79","volume":"Probab.Comput.5","author":"J Koml\u00f3s","year":"1996","unstructured":"J. Koml\u00f3s, E. Szemer\u00e9di: Topological cliques in graphs. II, Combin. Probab. Comput. 5 (1996), 79\u201390.","journal-title":"Combin."},{"key":"2806_CR12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02579141","volume":"4","author":"A Kostochka","year":"1984","unstructured":"A. Kostochka: Lower bound of the Hadwiger number of graphs by their average degree, Combinatorica 4 (1984), 307\u2013316.","journal-title":"Combinatorica"},{"key":"2806_CR13","series-title":"Ann. Discrete Math. 41","first-page":"325","volume-title":"Graph theory in memory of G. A. Dirac","author":"F Lescure","year":"1985","unstructured":"F. Lescure, H. Meyniel: On a problem upon configurations contained in graphs with given chromatic number, Graph theory in memory of G. A. Dirac (Sandbjerg, 1985), 325\u2013331, Ann. Discrete Math. 41, North-Holland, Amsterdam, 1989."},{"key":"2806_CR14","doi-asserted-by":"crossref","DOI":"10.1090\/chel\/367","volume-title":"Matching Theory","author":"L Lov\u00e1sz","year":"2009","unstructured":"L. Lov\u00e1sz, M. D. Plummer: Matching Theory, AMS Chelsea Publishing, Providence, RI, 2009."},{"key":"2806_CR15","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C St J A Nash-Williams","year":"1961","unstructured":"C. St. J. A. Nash-Williams: Edge-disjoint spanning trees of finite graphs, J. London Math. Soc. 36 (1961), 445\u2013450.","journal-title":"J. London Math. Soc."},{"key":"2806_CR16","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N Robertson","year":"2004","unstructured":"N. Robertson and P. D. Seymour: Graph minors. XX. Wagner\u2019s conjecture, J. Combin. Theory Ser. B 92 (2004), 325\u2013357.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2806_CR17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.jctb.2009.07.003","volume":"100","author":"N Robertson","year":"2010","unstructured":"N. Robertson and P. D. Seymour: Graph Minors XXIII, Nash-Williams\u2019 immersion conjecture, J. Combin. Theory Ser. B 100 (2010), 181\u2013205.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2806_CR18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01202354","volume":"13","author":"N Robertson","year":"1993","unstructured":"N. Robertson, P. D. Seymour and R. Thomas: Hadwiger\u2019s conjecture for K 6-free graphs, Combinatorica 13 (1993), 279\u2013361.","journal-title":"Combinatorica"},{"key":"2806_CR19","unstructured":"P. Seymour: personal communication."},{"key":"2806_CR20","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1006\/jctb.2000.2013","volume":"81","author":"A Thomason","year":"2001","unstructured":"A. Thomason: The extremal function for complete minors, J. Combin. Theory Ser. B 81 (2001), 318\u2013338.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2806_CR21","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W T Tutte","year":"1961","unstructured":"W. T. Tutte: On the problem of decomposing a graph into n connected factors, J. London Math. Soc. 36 (1961), 221\u2013230.","journal-title":"J. London Math. Soc."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2806-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-2806-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2806-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:13:29Z","timestamp":1565183609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-2806-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,8]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["2806"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-2806-z","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,8]]}}}