{"id":"https://openalex.org/W1993027198","doi":"https://doi.org/10.1007/s10878-013-9595-y","title":"General lower bound on the size of $$(H;k)$$ -stable graphs","display_name":"General lower bound on the size of $$(H;k)$$ -stable graphs","publication_year":2013,"publication_date":"2013-02-14","ids":{"openalex":"https://openalex.org/W1993027198","doi":"https://doi.org/10.1007/s10878-013-9595-y","mag":"1993027198"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-013-9595-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-013-9595-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-013-9595-y.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-013-9595-y.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060839833","display_name":"Andrzej \u017bak","orcid":"https://orcid.org/0000-0002-3657-1417"},"institutions":[{"id":"https://openalex.org/I686019","display_name":"AGH University of Krakow","ror":"https://ror.org/00bas1c41","country_code":"PL","type":"education","lineage":["https://openalex.org/I686019"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Andrzej \u017bak","raw_affiliation_strings":["AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 , Krak\u00f3w, Poland","AGH University of Science and Technology,,,Krak\u00f3w,,Poland,30-059"],"affiliations":[{"raw_affiliation_string":"AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 , Krak\u00f3w, Poland","institution_ids":["https://openalex.org/I686019"]},{"raw_affiliation_string":"AGH University of Science and Technology,,,Krak\u00f3w,,Poland,30-059","institution_ids":["https://openalex.org/I686019"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5060839833"],"corresponding_institution_ids":["https://openalex.org/I686019"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.7251,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71413467,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"29","issue":"2","first_page":"367","last_page":"372"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.852411687374115},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6823315024375916},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6573571562767029},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.642452597618103},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.616923451423645},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5256479978561401},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5099242925643921},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3700062036514282},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.06533822417259216}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.852411687374115},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6823315024375916},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6573571562767029},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.642452597618103},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.616923451423645},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5256479978561401},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5099242925643921},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3700062036514282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.06533822417259216},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-013-9595-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-013-9595-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-013-9595-y.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:29:y:2015:i:2:d:10.1007_s10878-013-9595-y","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-013-9595-y","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10878-013-9595-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-013-9595-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-013-9595-y.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1993027198.pdf","grobid_xml":"https://content.openalex.org/works/W1993027198.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W104732203","https://openalex.org/W1528113729","https://openalex.org/W1597081027","https://openalex.org/W1709720265","https://openalex.org/W1974725983","https://openalex.org/W2074123069","https://openalex.org/W2079827796","https://openalex.org/W2091580321","https://openalex.org/W2167844968","https://openalex.org/W2178910810","https://openalex.org/W2580817547","https://openalex.org/W2799004609","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2046228374","https://openalex.org/W1980648360","https://openalex.org/W2023302035","https://openalex.org/W2137161871","https://openalex.org/W2339534957","https://openalex.org/W2988282395","https://openalex.org/W341486533","https://openalex.org/W2557579792","https://openalex.org/W2353691047","https://openalex.org/W4313216298"],"abstract_inverted_index":{"A":[0],"graph":[1],"$$G$$":[2,9],"is":[3,69],"called":[4],"$$(H;k)$$":[5,26,37,54],"-vertex":[6,38],"stable":[7,39],"if":[8],"contains":[10],"a":[11,46],"subgraph":[12],"isomorphic":[13],"to":[14,57],"$$H$$":[15,65],"ever":[16],"after":[17],"removing":[18],"any":[19],"$$k$$":[20],"of":[21,35,64],"its":[22],"vertices.":[23],"By":[24],"stab":[25,53],"we":[27,44],"denote":[28],"the":[29,33,58],"minimum":[30,62],"size":[31],"among":[32],"sizes":[34],"all":[36],"graphs.":[40],"In":[41],"this":[42],"paper":[43],"present":[45],"first":[47],"(non-trivial)":[48],"general":[49],"lower":[50],"bound":[51,68],"for":[52,72],"with":[55],"regard":[56],"order,":[59],"connectivity":[60],"and":[61],"degree":[63],".":[66,74],"This":[67],"nearly":[70],"sharp":[71],"$$k=1$$":[73]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}