{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:01Z","timestamp":1740122401266,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,7,8]],"date-time":"2017-07-08T00:00:00Z","timestamp":1499472000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11331003","11671087"],"award-info":[{"award-number":["11331003","11671087"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"New Century Support Program of Fujian Province","award":["JA14028"],"award-info":[{"award-number":["JA14028"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10878-017-0153-x","type":"journal-article","created":{"date-parts":[[2017,7,8]],"date-time":"2017-07-08T04:21:37Z","timestamp":1499487697000},"page":"48-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Partitioning dense uniform hypergraphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Shufei","family":"Wu","sequence":"first","affiliation":[]},{"given":"Jianfeng","family":"Hou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,8]]},"reference":[{"key":"153_CR1","doi-asserted-by":"crossref","first-page":"357","DOI":"10.2748\/tmj\/1178243286","volume":"19","author":"K Azuma","year":"1967","unstructured":"Azuma K (1967) Weighted sums of certain dependent random variables. Tokuku Math J 19:357\u2013367","journal-title":"Tokuku Math J"},{"key":"153_CR2","volume-title":"Graph theory, graduate texts in mathematics","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory, graduate texts in mathematics. Springer, New York"},{"key":"153_CR3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1006\/jcta.1996.2744","volume":"78","author":"B Bollob\u00e1s","year":"1997","unstructured":"Bollob\u00e1s B, Scott AD (1997) Judicious partitions of hypergraphs. J Comb Theory Ser A 78:15\u201331","journal-title":"J Comb Theory Ser A"},{"key":"153_CR4","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1002\/rsa.10062","volume":"21","author":"B Bollob\u00e1s","year":"2002","unstructured":"Bollob\u00e1s B, Scott AD (2002) Problems and results on judicious partitions. Random Struct Algorithms 21:414\u2013430","journal-title":"Random Struct Algorithms"},{"key":"153_CR5","doi-asserted-by":"crossref","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","volume":"3","author":"CS Edwards","year":"1973","unstructured":"Edwards CS (1973) Some extremal properties of bipartite graphs. Can J Math 3:475\u2013485","journal-title":"Can J Math"},{"unstructured":"Edwards CS (1975) An improved lower bound for the number of edges in a largest bipartite subgraph. In: Proceedings of 2nd Czechoslovak symposium on graph theory, pp 167\u2013181","key":"153_CR6"},{"issue":"1","key":"153_CR7","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/rsa.20642","volume":"50","author":"G Fan","year":"2017","unstructured":"Fan G, Hou J (2017) Bounds for pairs in judicious partitioning of graphs. Random Struct Algorithms 50(1):59\u201370","journal-title":"Random Struct Algorithms"},{"key":"153_CR8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.dam.2014.07.002","volume":"179","author":"G Fan","year":"2014","unstructured":"Fan G, Hou J, Zeng Q (2014) A bound for judicious \n                        $$k$$\n                        \n                            \n                                k\n                            \n                        \n                    -partitions of graphs. Discret Appl Math 179:86\u201399","journal-title":"Discret Appl Math"},{"key":"153_CR9","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s00493-012-2696-x","volume":"32","author":"J Haslegrave","year":"2012","unstructured":"Haslegrave J (2012) The Bollob\u00e1s\u2013Thomason conjecture for 3-uniform hypergraphs. Combinatorica 32:451\u2013471","journal-title":"Combinatorica"},{"key":"153_CR10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J Am Stat Assoc 58:13\u201330","journal-title":"J Am Stat Assoc"},{"key":"153_CR11","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.jcta.2016.02.004","volume":"141","author":"J Hou","year":"2016","unstructured":"Hou J, Wu S, Yan G (2016) On judicious partitions of uniform hypergraphs. J Comb Theory Ser A 141:16\u201332","journal-title":"J Comb Theory Ser A"},{"key":"153_CR12","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random graphs","author":"S Janson","year":"2000","unstructured":"Janson S, \u0141uczak T, Ruci\u0144ski A (2000) Random graphs. Wiley, New York"},{"key":"153_CR13","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/s10878-012-9539-y","volume":"27","author":"H Li","year":"2014","unstructured":"Li H, Liang Y, Liu M, Xu B (2014) On minimum balanced bipartitions of triangle-free graphs. J Comb Optim 27:557\u2013566","journal-title":"J Comb Optim"},{"key":"153_CR14","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/j.jctb.2010.06.002","volume":"100","author":"J Ma","year":"2010","unstructured":"Ma J, Yen P, Yu X (2010) On several partitioning problems of Bollob\u00e1s and Scott. J Comb Theory Ser B 100:631\u2013649","journal-title":"J Comb Theory Ser B"},{"key":"153_CR15","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.jctb.2011.07.001","volume":"102","author":"J Ma","year":"2012","unstructured":"Ma J, Yu X (2012) Partitioning 3-uniform hypergraphs. J Comb Theory Ser B 102:212\u2013232","journal-title":"J Comb Theory Ser B"},{"key":"153_CR16","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s00493-015-2944-y","volume":"36","author":"J Ma","year":"2016","unstructured":"Ma J, Yu X (2016) On judicious bipartitions of graphs. Combinatorica 36:537\u2013556","journal-title":"Combinatorica"},{"issue":"1","key":"153_CR17","first-page":"1","volume":"45","author":"B Xu","year":"2016","unstructured":"Xu B (2016) Graph partitions: recent progresses and some open problems. Adv Math (China) 45(1):1\u201320","journal-title":"Adv Math (China)"},{"key":"153_CR18","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/j.jctb.2008.08.007","volume":"99","author":"B Xu","year":"2009","unstructured":"Xu B, Yu X (2009) Judicious \n                        $$k$$\n                        \n                            \n                                k\n                            \n                        \n                    -partitions of graphs. J Comb Theory Ser B 99:324\u2013337","journal-title":"J Comb Theory Ser B"},{"key":"153_CR19","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1017\/S0963548311000204","volume":"20","author":"B Xu","year":"2011","unstructured":"Xu B, Yu X (2011) Better bounds for \n                        $$k$$\n                        \n                            \n                                k\n                            \n                        \n                    -partitions of graphs. Comb Probab Comput 20:631\u2013640","journal-title":"Comb Probab Comput"},{"key":"153_CR20","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.jctb.2014.01.004","volume":"106","author":"B Xu","year":"2014","unstructured":"Xu B, Yu X (2014) On judicious bisections of graphs. J Comb Theory Ser B 106:30\u201369","journal-title":"J Comb Theory Ser B"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0153-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0153-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0153-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,8]],"date-time":"2018-01-08T10:32:13Z","timestamp":1515407533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0153-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,8]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["153"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0153-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,7,8]]}}}