{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:50:17Z","timestamp":1767034217658},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T00:00:00Z","timestamp":1684800000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T00:00:00Z","timestamp":1684800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s00493-023-00039-2","type":"journal-article","created":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T06:02:06Z","timestamp":1684821726000},"page":"885-907","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Balanced Subdivisions of Cliques in Graphs"],"prefix":"10.1007","volume":"43","author":[{"given":"Bingyu","family":"Luan","sequence":"first","affiliation":[]},{"given":"Yantao","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Guanghui","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Donglei","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1017\/S0963548303005741","volume":"12","author":"N Alon","year":"2003","unstructured":"Alon, N., Krivelevich, M., Sudakov, B.: Tur\u00e1n numbers of bipartite graphs and related Ramsey-type questions. Comb. Probab. Comput. 12, 477\u2013494 (2003)","journal-title":"Comb. Probab. Comput."},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.jctb.2014.11.004","volume":"112","author":"J Balogh","year":"2015","unstructured":"Balogh, J., Liu, H., Sharifzadeh, M.: Subdivisions of a large clique in $$C_6$$-free graphs. J. Comb. Theory B 112, 18\u201335 (2015)","journal-title":"J. Comb. Theory B"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1006\/eujc.1997.0188","volume":"19","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B., Thomason, A.: Proof of a conjecture of Mader, Erd\u0151s and Hajnal on topological complete subgraphs. Eur. J. Comb. 19, 883\u2013887 (1998)","journal-title":"Eur. J. Comb."},{"key":"39_CR4","unstructured":"Erd\u0151s, P.: Problems and Results in Graph Theory and Combinatorial Analysis. Graph Theory and Related Topics (Proc. Conf. Waterloo, vol. 1979, pp. 153\u2013163. Academic Press. New York (1977)"},{"key":"39_CR5","first-page":"193","volume":"7","author":"P Erd\u0151s","year":"1969","unstructured":"Erd\u0151s, P., Hajnal, A.: On topological complete subgraphs of certain graphs. Annales Universitatis Scientiarum Budapestinensis de Rolando E\u00f6tv\u00f6s Nominatae Sectio Computatorica 7, 193\u2013199 (1969)","journal-title":"Annales Universitatis Scientiarum Budapestinensis de Rolando E\u00f6tv\u00f6s Nominatae Sectio Computatorica"},{"key":"39_CR6","unstructured":"Fern\u00e1ndez, G., Hyde, J., Liu, H., Pikhurko, O., Wu, Z.: Disjoint isomorphic balanced clique subdivisions. arXiv preprint, arXiv:2204.12465"},{"issue":"1\u20132","key":"39_CR7","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1002\/rsa.20344","volume":"38","author":"J Fox","year":"2011","unstructured":"Fox, J., Sudakov, B.: Dependent random choice. Random Struct. Algorithms 38(1\u20132), 68\u201399 (2011)","journal-title":"Random Struct. Algorithms"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01350174","volume":"187","author":"HA Jung","year":"1970","unstructured":"Jung, H.A.: Eine Verallgemeinerung des $$n$$-fachen Zusammenhangs f\u00fcr Graphen. Math. Ann. 187, 95\u2013103 (1970)","journal-title":"Math. Ann."},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1006\/jctb.2002.2133","volume":"86","author":"D K\u00fchn","year":"2002","unstructured":"K\u00fchn, D., Osthus, D.: Topological minors in graphs of large girth. J. Comb. Theory B 86, 364\u2013380 (2002)","journal-title":"J. Comb. Theory B"},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1017\/S0963548303005650","volume":"13","author":"D K\u00fchn","year":"2004","unstructured":"K\u00fchn, D., Osthus, D.: Large topological cliques in graphs without a 4-cycle. Comb. Probab. Comput. 13, 93\u2013102 (2004)","journal-title":"Comb. Probab. Comput."},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1137\/040617765","volume":"20","author":"D K\u00fchn","year":"2006","unstructured":"K\u00fchn, D., Osthus, D.: Improved bounds for topological cliques in graphs of large girth. SIAM J. Discret. Math. 20, 62\u201378 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"39_CR12","doi-asserted-by":"publisher","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T K\u0151v\u00e1ri","year":"1954","unstructured":"K\u0151v\u00e1ri, T., S\u00f3s, V.T., Tur\u00e1n, P.: On a problem of K. Zarankiewicz. Colloq. Math. 3, 50\u201357 (1954)","journal-title":"Zarankiewicz. Colloq. Math."},{"key":"39_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1017\/S0963548300001140","volume":"3","author":"J Koml\u00f3s","year":"1994","unstructured":"Koml\u00f3s, J., Szemer\u00e9di, E.: Topological cliques in graphs. Comb. Probab. Comput. 3, 247\u2013256 (1994)","journal-title":"Comb. Probab. Comput."},{"key":"39_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1017\/S096354830000184X","volume":"5","author":"J Koml\u00f3s","year":"1996","unstructured":"Koml\u00f3s, J., Szemer\u00e9di, E.: Topological cliques in graphs II. Comb. Probab. Comput. 5, 79\u201390 (1996)","journal-title":"Comb. Probab. Comput."},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"16","author":"J Kuratowski","year":"1930","unstructured":"Kuratowski, J.: Sur le probleme des courbes gauches en topologie. Fundam. Math. 16, 271\u2013283 (1930)","journal-title":"Fundam. Math."},{"issue":"1","key":"39_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1112\/jlms.12019","volume":"95","author":"H Liu","year":"2017","unstructured":"Liu, H., Montgomery, R.H.: A proof of Mader\u2019s conjecture on large clique subdivisions in $$C_4$$-free graphs. J. Lond. Math. Soc. 95(1), 203\u2013222 (2017)","journal-title":"J. Lond. Math. Soc."},{"key":"39_CR17","doi-asserted-by":"publisher","unstructured":"Liu, H., Montgomery, R.H.: A solution to Erd\u0151s and Hajnal\u2019s odd cycle problem. J. Am. Math. Soc. https:\/\/doi.org\/10.1090\/jams\/1018","DOI":"10.1090\/jams\/1018"},{"key":"39_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01364272","volume":"174","author":"W Mader","year":"1967","unstructured":"Mader, W.: Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Math. Ann. 174, 265\u2013268 (1967)","journal-title":"Math. Ann."},{"issue":"1\u20136","key":"39_CR19","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/mana.19720530113","volume":"53","author":"W Mader","year":"1972","unstructured":"Mader, W.: Hinreichende Bedingungen f\u0171r die Existenz von Teilgraphen, die zu einem vollsta\u030bndigen Graphen hom\u0151omorph sind. Math. Nachr. 53(1\u20136), 145\u2013150 (1972)","journal-title":"Math. Nachr."},{"key":"39_CR20","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/(SICI)1097-0118(199904)30:4<261::AID-JGT2>3.0.CO;2-Z","volume":"30","author":"W Mader","year":"1999","unstructured":"Mader, W.: An extremal problem for subdivisions of $$K_5^-$$. J. Graph Theory 30, 261\u2013276 (1999)","journal-title":"J. Graph Theory"},{"issue":"1","key":"39_CR21","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/jgt.3190080103","volume":"8","author":"C Thomassen","year":"1984","unstructured":"Thomassen, C.: Subdivisions of graphs with large minimum degree. J. Graph Theory 8(1), 23\u201328 (1984)","journal-title":"J. Graph Theory"},{"key":"39_CR22","volume-title":"Graphs, Hypergraphs and Applications","author":"C Thomassen","year":"1985","unstructured":"Thomassen, C.: Problems 20 and 21. In: Sachs, H. (ed.) Graphs, Hypergraphs and Applications, vol. 217. Teubner, Leipzig (1985)"},{"key":"39_CR23","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1111\/j.1749-6632.1989.tb22479.x","volume":"1","author":"C Thomassen","year":"1989","unstructured":"Thomassen, C.: Configurations in graphs of large minimum degree, connectivity, or chromatic number. Ann. N. Y. Acad. Sci. 1, 402\u2013412 (1989)","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"39_CR24","first-page":"92","volume":"1","author":"J Verstra\u00ebte","year":"2002","unstructured":"Verstra\u00ebte, J.: A note on vertex-disjoint cycles. Comb. Probab. Comput. 1, 92\u2013102 (2002)","journal-title":"Comb. Probab. Comput."},{"key":"39_CR25","unstructured":"Wang, Y.: Balanced subdivisions of a large clique in graphs with high average degree. arXiv preprint, arXiv:2107.06583v1"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00039-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-023-00039-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00039-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T19:01:22Z","timestamp":1696186882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-023-00039-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,23]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["39"],"URL":"https:\/\/doi.org\/10.1007\/s00493-023-00039-2","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,23]]},"assertion":[{"value":"25 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}