{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T23:22:04Z","timestamp":1783984924257,"version":"3.55.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"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":[[1996,9]]},"DOI":"10.1007\/bf01261316","type":"journal-article","created":{"date-parts":[[2005,3,23]],"date-time":"2005-03-23T22:01:48Z","timestamp":1111615308000},"page":"313-320","source":"Crossref","is-referenced-by-count":75,"title":["Highly linked graphs"],"prefix":"10.1007","volume":"16","author":[{"given":"B\ufffdla","family":"Bollob\ufffds","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Thomason","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Extremal Graph Theory","author":"B. Bollob\ufffds","year":"1978","unstructured":"B. Bollob\ufffds:Extremal Graph Theory, Academic Press, London, (1978)."},{"key":"CR2","unstructured":"B. Bollob\ufffds, andA. Thomason: Topological complete subgraphs (submitted to European Journal of Combinatorics)."},{"key":"CR3","first-page":"4252","volume":"250","author":"G. A. Dirac","year":"1960","unstructured":"G. A. Dirac: G\ufffdn\ufffdralisations du th\ufffdor\ufffdme de Menger,C. R. Acad. Sci. Paris,250 (1960), 4252?4253.","journal-title":"C. R. Acad. Sci. Paris"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S1385-7258(54)50043-0","volume":"16","author":"G. A. Dirac","year":"1954","unstructured":"G. A. Dirac, andS. Schuster: A theorem of Kuratowski,Indag. Math. 16 (1954), 343?348.","journal-title":"Indag. Math."},{"key":"CR5","unstructured":"P. Erd?s, andA. Hajnal: On topological complete subgraphs of certain graphs,Annales Univ. Sci. Budapest., (1969), 193?199."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF01787639","volume":"7","author":"A. Huck","year":"1991","unstructured":"A. Huck: A sufficient condition for a graph to be weaklyk-linked,Graphs and Combinatorics,7 (1991), 323?351.","journal-title":"Graphs and Combinatorics"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01350174","volume":"187","author":"H. A. Jung","year":"1970","unstructured":"H. A. Jung: Verallgemeinerung desn-fachen zusammenhangs f\ufffdr Graphen,Math. Ann.,187 (1970), 95?103.","journal-title":"Math. Ann."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"R. M. Karp","year":"1975","unstructured":"R. M. Karp: On the complexity of combinatorial problems,Networks,5 (1975), 45?68.","journal-title":"Networks"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1017\/S0963548300001140","volume":"3","author":"J. Koml\ufffds","year":"1994","unstructured":"J. Koml\ufffds, andE. Szemer\ufffddi: Topological cliques in graphs,Combinatorics, Probability and Computing,3 (1994), 247?256.","journal-title":"Combinatorics, Probability and Computing"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1017\/S096354830000184X","volume":"5","author":"J. Koml\ufffds","year":"1996","unstructured":"J. Koml\ufffds, andE. Szemer\ufffddi: Topological cliques in graphs II,Combinatorics, Probrability and Computing,5 (1996), 79?90.","journal-title":"Combinatorics, Probrability and Computing"},{"key":"CR11","first-page":"37","volume":"38","author":"A. Kostochka","year":"1982","unstructured":"A. Kostochka: A lower bound for the Hadwiger number of a graph as a function of the average degree of its vertices,Discret. Analyz, Novosibirsk,38 (1982), 37?58.","journal-title":"Discret. Analyz, Novosibirsk"},{"key":"CR12","first-page":"144","volume":"20","author":"D. G. Larman","year":"1974","unstructured":"D. G. Larman, andP. Mani: On the existence of certain configurations within graphs and the 1-skeletons of polytopes,Proc. London Math. Soc.,20 (1974), 144?160.","journal-title":"Proc. London Math. Soc."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01364272","volume":"174","author":"W. Mader","year":"1967","unstructured":"W. Mader: Homomorphieeigenschaften und mittlere Kantendichte von Graphen,Math. Annalen,174 (1967), 265?268.","journal-title":"Math. Annalen"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/BF02993903","volume":"37","author":"W. Mader","year":"1972","unstructured":"W. Mader: Existenzn-fach zusammenh\ufffdngender Teilgraphen in Graphen genugend grossen Kantendichte,Abh. Math. Sem Hamburg Univ.,37 (1972), 86?97.","journal-title":"Abh. Math. Sem Hamburg Univ."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/mana.19720530113","volume":"53","author":"W. Mader","year":"1972","unstructured":"W. Mader: Hinreichende Bedingungen f\ufffdr die Existenz von Teilgraphen, die zu einem vollst\ufffdndigen Graphen homomorph sind,Math. Nachr. 53 (1972), 145?150.","journal-title":"Math. Nachr."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"N. Robertson, andP. Seymour: Graph Minors XIII, The disjoint paths problem,Journal of Combin. Theory, Ser. B,63 (1995), 65?100.","journal-title":"Journal of Combin. Theory, Ser. B"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","volume":"29","author":"P. Seymour","year":"1980","unstructured":"P. Seymour: Disjoint paths in graphs,Discrete Math.,29 (1980) 293?309.","journal-title":"Discrete Math."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1017\/S0305004100061521","volume":"95","author":"A. Thomason","year":"1984","unstructured":"A. Thomason: An extremal function for complete subgraphs,Math. Proc. Camb. Phil. Soc.,95 (1984), 261?265.","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0195-6698(80)80039-4","volume":"1","author":"C. Thomassen","year":"1980","unstructured":"C. Thomassen: 2-linked graphs,Europ. J. Combinatorics,1 (1980), 371?378.","journal-title":"Europ. J. Combinatorics"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF01275674","volume":"11","author":"C. Thomassen","year":"1991","unstructured":"C. Thomassen: Highly connected non-2-linked graphs,Combinatorica,11 (1991), 393?395.","journal-title":"Combinatorica"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01261316.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01261316\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01261316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T11:08:44Z","timestamp":1556795324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01261316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["BF01261316"],"URL":"https:\/\/doi.org\/10.1007\/bf01261316","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}