{"id":"https://openalex.org/W4291014513","doi":"https://doi.org/10.1142/s1793830922501324","title":"Some bounds on the size of maximum G-free sets in graphs","display_name":"Some bounds on the size of maximum G-free sets in graphs","publication_year":2022,"publication_date":"2022-08-12","ids":{"openalex":"https://openalex.org/W4291014513","doi":"https://doi.org/10.1142/s1793830922501324"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830922501324","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922501324","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079719299","display_name":"Yaser Rowshan","orcid":null},"institutions":[{"id":"https://openalex.org/I161028277","display_name":"Institute for Advanced Studies in Basic Sciences","ror":"https://ror.org/00bzsst90","country_code":"IR","type":"education","lineage":["https://openalex.org/I161028277"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Yaser Rowshan","raw_affiliation_strings":["Department of Mathematics, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan 45137-66731, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan 45137-66731, Iran","institution_ids":["https://openalex.org/I161028277"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079719299"],"corresponding_institution_ids":["https://openalex.org/I161028277"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10986192,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"05","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6560516357421875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5246484279632568},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42531290650367737},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3403584361076355}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6560516357421875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5246484279632568},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42531290650367737},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3403584361076355}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830922501324","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922501324","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1489936145","https://openalex.org/W1976217907","https://openalex.org/W2000620038","https://openalex.org/W2014928604","https://openalex.org/W2033436489","https://openalex.org/W2035645338","https://openalex.org/W2047035505","https://openalex.org/W3006314047","https://openalex.org/W3141776272","https://openalex.org/W4240625092","https://openalex.org/W4242102268"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"For":[0],"a":[1,35,88,95,99,105,115,177,193,199,218],"given":[2],"graph":[3,36,100,197],"[Formula:":[4,10,14,26,55,64,70,74,84,91,101,106,109,118,123,126,131,136,141,144,148,155,160,164,173,180,184,189,194,231],"see":[5,11,15,27,56,65,71,75,85,92,102,107,110,119,124,127,132,137,142,145,149,156,161,165,174,181,185,190,195,232],"text],":[6,57,66,125,128,138,186],"the":[7,18,21,30,42,48,51,60,152,210,214,226,229],"independence":[8,43,215],"number":[9,44,62,216],"text]":[12,16,76,86,93,103,120,133,146,157,162,182,191],"of":[13,20,25,41,50,54,63,97,117,154,172,183,213,217,228,235,240],"is":[17,37,45,77,87,94,147,163,192,198],"size":[19,49,227],"maximum":[22,31,178,230],"independent":[23,32],"set":[24,33],"text].":[28,72,143,175],"Finding":[29,73,176],"in":[34],"NP-hard.":[38],"Another":[39],"version":[40,212],"defined":[46],"as":[47,203,237],"maximum-induced":[52],"forest":[53,61],"and":[58,67,90,139],"called":[59],"denoted":[68],"by":[69,159],"also":[78],"an":[79],"NP-hard":[80],"problem.":[81],"Suppose":[82],"that":[83,130,188],"graph,":[89],"family":[96],"graphs,":[98],"has":[104],"text]-free":[108,196,233],"text]-coloring":[111],"if":[112,151],"there":[113],"exists":[114],"decomposition":[116],"into":[121],"sets":[122],"so":[129],"for":[134],"each":[135,140],"text]-free,":[150,166],"subgraph":[153],"induced":[158],"i.e.,":[167],"it":[168],"contains":[169],"no":[170],"copy":[171],"subset":[179,234],"such":[187],"very":[200],"hard":[201],"problem":[202],"well.":[204],"In":[205],"this":[206,241],"paper,":[207],"we":[208,221],"study":[209],"generalized":[211],"graph.":[219],"Also,":[220],"give":[222],"some":[223],"bounds":[224],"about":[225],"graphs":[236],"another":[238],"purpose":[239],"paper.":[242]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}