{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:28:08Z","timestamp":1770337688024,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:00:00Z","timestamp":1586563200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:00:00Z","timestamp":1586563200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11531011"],"award-info":[{"award-number":["11531011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s00373-020-02165-w","type":"journal-article","created":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T15:02:16Z","timestamp":1586617336000},"page":"1065-1078","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Shuang","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingzhi","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jixiang","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,11]]},"reference":[{"key":"2165_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0012-365X(79)90139-0","volume":"28","author":"B Bollob\u00e1s","year":"1979","unstructured":"Bollob\u00e1s, B.: On graphs with equal edge-connectivity and minimum degree. Discrete Math. 28, 321\u2013323 (1979)","journal-title":"Discrete Math."},{"key":"2165_CR2","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1137\/0114065","volume":"14","author":"G Chartrand","year":"1966","unstructured":"Chartrand, G.: A graph-theoretic approach to a communications problem. SIAM J. Appl. Math. 14, 778\u2013781 (1966)","journal-title":"SIAM J. Appl. Math."},{"key":"2165_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1002\/(SICI)1097-0118(199709)26:1<27::AID-JGT4>3.0.CO;2-J","volume":"26","author":"P Dankelmann","year":"1997","unstructured":"Dankelmann, P., Volkmann, L.: Degree sequence conditions for maxiamlly edge-connected graphs and digraphs. J. Graph Theory 26, 27\u201334 (1997)","journal-title":"J. Graph Theory"},{"key":"2165_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.disc.2015.07.008","volume":"339","author":"P Dankelmann","year":"2016","unstructured":"Dankelmann, P., Meierling, D.: Maximally edge-connected hypergraphs. Discrete Math. 339, 33\u201338 (2016)","journal-title":"Discrete Math."},{"key":"2165_CR5","doi-asserted-by":"publisher","first-page":"252","DOI":"10.4153\/CMB-2018-005-9","volume":"61","author":"M Dewar","year":"2018","unstructured":"Dewar, M., Pike, D., Proos, J.: Connectivity in hypergraphs. Can. Math. Bull. 61, 252\u2013271 (2018)","journal-title":"Can. Math. Bull."},{"key":"2165_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0012-365X(78)90184-X","volume":"23","author":"DL Goldsmith","year":"1978","unstructured":"Goldsmith, D.L., White, A.T.: On graphs with equal edge-connectivity and minimum degree. Discrete Math. 23, 31\u201336 (1978)","journal-title":"Discrete Math."},{"key":"2165_CR7","doi-asserted-by":"publisher","first-page":"1394","DOI":"10.1016\/j.disc.2013.03.003","volume":"313","author":"XF Gu","year":"2013","unstructured":"Gu, X.F., Lai, H.J.: Realizing degree sequences with $$k$$-edge-connected uniform hypergraphs. Discrete Math. 313, 1394\u20131400 (2013)","journal-title":"Discrete Math."},{"key":"2165_CR8","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1016\/j.disc.2007.06.035","volume":"308","author":"A Hellwig","year":"2008","unstructured":"Hellwig, A., Volkmann, L.: Maximally edge-connected and vertex-connected graphs and digraphs\u2014a survey. Discrete Math. 308, 3265\u20133296 (2008)","journal-title":"Discrete Math."},{"key":"2165_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1137\/1117029","volume":"17","author":"AK Kelmans","year":"1972","unstructured":"Kelmans, A.K.: Asymptonic formulas for the probability of $$k$$-connectedness of random graphs. Theory Probab. Appl. 17, 243\u2013254 (1972)","journal-title":"Theory Probab. Appl."},{"key":"2165_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.11.004","author":"EF Shan","year":"2019","unstructured":"Shan, E.F., Zhao, J., Zhao, L.Y.: Maximally connected $$p$$-partite uniform hypergraphs. Discrete Appl. Math. (2019). https:\/\/doi.org\/10.1016\/j.dam.2018.11.004","journal-title":"Discrete Appl. Math"},{"key":"2165_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-018-0224-4","author":"LK Tong","year":"2018","unstructured":"Tong, L.K., Shan, E.F.: Sufficient conditions for maximally edge-connected hypergraphs. J. Operat. Resear. Soc. Chin. (2018). https:\/\/doi.org\/10.1007\/s40305-018-0224-4","journal-title":"J. Operat. Resear. Soc. Chin."},{"key":"2165_CR12","first-page":"237","volume":"67","author":"L Volkmann","year":"2003","unstructured":"Volkmann, L.: Degree sequence conditions for super edge-connected graphs and digraphs. Ars Comb. 67, 237\u2013249 (2003)","journal-title":"Ars Comb."},{"key":"2165_CR13","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and the connectivity of a graph. Amer. J. Math. 54, 150\u2013168 (1932)","journal-title":"Amer. J. Math."},{"key":"2165_CR14","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.cam.2017.11.020","volume":"333","author":"S Zhao","year":"2018","unstructured":"Zhao, S., Meng, J.X.: Sufficient conditions for hypergraphs to be maximally edge-connected hypergraphs. Appl. Math. Comput. 333, 362\u2013368 (2018)","journal-title":"Appl. Math. Comput."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02165-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02165-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02165-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T23:11:17Z","timestamp":1618096277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02165-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,11]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["2165"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02165-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,11]]},"assertion":[{"value":"18 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}