{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T21:59:21Z","timestamp":1761861561571},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,2,15]],"date-time":"2013-02-15T00:00:00Z","timestamp":1360886400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10878-013-9595-y","type":"journal-article","created":{"date-parts":[[2013,2,14]],"date-time":"2013-02-14T04:21:34Z","timestamp":1360815694000},"page":"367-372","source":"Crossref","is-referenced-by-count":1,"title":["General lower bound on the size of $$(H;k)$$ -stable graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Andrzej","family":"\u017bak","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,15]]},"reference":[{"issue":"1","key":"9595_CR1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.37236\/692","volume":"18","author":"S Cichacz","year":"2011","unstructured":"Cichacz S, G\u00f6rlich A, Zwonek M, \u017bak A (2011) On $$(C_n;k)$$ stable graphs. Electron J Comb 18(1):205","journal-title":"Electron J Comb"},{"key":"9595_CR2","doi-asserted-by":"crossref","unstructured":"Cichacz S, G\u00f6rlich A, Nikodem M, \u017bak A (2012) A lower bound on the size of $$(H; 1)$$ -vertex stable graphs. Discrete Math 312:3026\u20133029","DOI":"10.1016\/j.disc.2012.06.023"},{"issue":"1","key":"9595_CR3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.7151\/dmgt.1397","volume":"28","author":"A Dudek","year":"2008","unstructured":"Dudek A, Szyma\u0144ski A, Zwonek M (2008) $$(H, k)$$ stable graphs with minimum size. Discuss Math Graph Theory 28(1):137\u2013149","journal-title":"Discuss Math Graph Theory"},{"key":"9595_CR4","doi-asserted-by":"crossref","first-page":"573","DOI":"10.7151\/dmgt.1465","volume":"29","author":"A Dudek","year":"2009","unstructured":"Dudek A, Zwonek M (2009) $$(H, k)$$ stable bipartite graphs with minimum size. Discuss Math Graph Theory 29:573\u2013581","journal-title":"Discuss Math Graph Theory"},{"key":"9595_CR5","doi-asserted-by":"crossref","first-page":"663","DOI":"10.7151\/dmgt.1521","volume":"30","author":"A Dudek","year":"2010","unstructured":"Dudek A, \u017bak A (2010) On vertex stability with regard to complete bipartite subgraphs. Discuss Math Graph Theory 30:663\u2013669","journal-title":"Discuss Math Graph Theory"},{"key":"9595_CR6","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1016\/j.disc.2011.04.017","volume":"312","author":"J-L Fouquet","year":"2012","unstructured":"Fouquet J-L, Thuillier H, Vanherpe J-M, Wojda AP (2012) On $$(K_q; k)$$ vertex stable graphs with minimum size. Discrete Math 312:2109\u20132118","journal-title":"Discrete Math"},{"key":"9595_CR7","doi-asserted-by":"crossref","first-page":"50","DOI":"10.37236\/2435","volume":"19","author":"J-L Fouquet","year":"2012","unstructured":"Fouquet J-L, Thuillier H, Vanherpe J-M, Wojda AP (2012) On $$(K_q; k)$$ stable graphs with small k. Electron J Comb 19:50","journal-title":"Electron J Comb"},{"key":"9595_CR8","doi-asserted-by":"crossref","first-page":"1415","DOI":"10.1016\/j.disc.2007.07.074","volume":"308","author":"P Frankl","year":"2008","unstructured":"Frankl P, Katona GY (2008) Extremal $$k$$ -edge Hamiltonian hypergraphs. Discrete Math 308:1415\u20131424","journal-title":"Discrete Math"},{"key":"9595_CR9","doi-asserted-by":"crossref","first-page":"1786","DOI":"10.1016\/j.dam.2010.11.016","volume":"16","author":"I Horv\u00e1th","year":"2011","unstructured":"Horv\u00e1th I, Katona GY (2011) Extremal $$P_4$$ -stable graphs. Discrete Appl Math 16:1786\u20131792","journal-title":"Discrete Appl Math"},{"key":"9595_CR10","doi-asserted-by":"crossref","unstructured":"\u017bak A (2011) On $$(K_q;k)$$ -stable graphs, J. Graph Theory. doi: 10.1002\/jgt.21705 .","DOI":"10.1002\/jgt.21705"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9595-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9595-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9595-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T09:03:42Z","timestamp":1595408622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9595-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,15]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9595"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9595-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,15]]}}}