{"id":"https://openalex.org/W1992511794","doi":"https://doi.org/10.1002/jgt.3190100209","title":"Saturated graphs with minimal number of edges","display_name":"Saturated graphs with minimal number of edges","publication_year":1986,"publication_date":"1986-06-01","ids":{"openalex":"https://openalex.org/W1992511794","doi":"https://doi.org/10.1002/jgt.3190100209","mag":"1992511794"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190100209","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190100209","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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/A5034622467","display_name":"L. K\u00e1szonyi","orcid":null},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"L. K\u00e1szonyi","raw_affiliation_strings":["Dept. of Probability Eo\u0308tvo\u0308s L. university H-1088 Budapest Muzeum KRT, 6\u20138, Hungary","Dept. of Probability E\u00f6tv\u00f6s L. university H\u20101088 Budapest Muzeum KRT, 6\u20138, Hungary"],"affiliations":[{"raw_affiliation_string":"Dept. of Probability Eo\u0308tvo\u0308s L. university H-1088 Budapest Muzeum KRT, 6\u20138, Hungary","institution_ids":["https://openalex.org/I106118109"]},{"raw_affiliation_string":"Dept. of Probability E\u00f6tv\u00f6s L. university H\u20101088 Budapest Muzeum KRT, 6\u20138, Hungary","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058903630","display_name":"Zs. Tuza","orcid":null},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Zs. Tuza","raw_affiliation_strings":["Computer and Automation Institute of the Hungarian Academy of Sciences H-1111 Budapest Kende U. 13\u201317. Hungary","Computer and Automation Institute of the Hungarian Academy of Sciences H\u20101111 Budapest Kende U. 13\u201317. Hungary"],"affiliations":[{"raw_affiliation_string":"Computer and Automation Institute of the Hungarian Academy of Sciences H-1111 Budapest Kende U. 13\u201317. Hungary","institution_ids":["https://openalex.org/I7597260"]},{"raw_affiliation_string":"Computer and Automation Institute of the Hungarian Academy of Sciences H\u20101111 Budapest Kende U. 13\u201317. Hungary","institution_ids":["https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034622467"],"corresponding_institution_ids":["https://openalex.org/I106118109"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.4946,"has_fulltext":false,"cited_by_count":173,"citation_normalized_percentile":{"value":0.60211028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"10","issue":"2","first_page":"203","last_page":"210"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9993000030517578,"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.996999979019165,"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.8622394800186157},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7947626113891602},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.5875754356384277},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.55854332447052},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4946088492870331},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4836336374282837},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45123109221458435},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.327589750289917},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.27927035093307495}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8622394800186157},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7947626113891602},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.5875754356384277},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.55854332447052},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4946088492870331},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4836336374282837},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45123109221458435},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.327589750289917},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.27927035093307495},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190100209","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190100209","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1963681333","https://openalex.org/W1990490082","https://openalex.org/W2068795011","https://openalex.org/W2315931347"],"related_works":["https://openalex.org/W2020053772","https://openalex.org/W2035433397","https://openalex.org/W3160792420","https://openalex.org/W4287181997","https://openalex.org/W2886071965","https://openalex.org/W4297803065","https://openalex.org/W3168725788","https://openalex.org/W3175659217","https://openalex.org/W2471801930","https://openalex.org/W2083238533"],"abstract_inverted_index":{"Abstract":[0],"Let":[1],"F":[2,5,23,26],"=":[3],"{":[4],"1":[6],",\u2026}":[7],"be":[8],"a":[9,28,41],"given":[10,60],"class":[11],"of":[12,30,35,50,64],"forbidden":[13,42,72],"graphs.":[14],"A":[15],"graph":[16],"G":[17,31],"is":[18,27,55,67],"called":[19],"F\u2010saturated":[20,53],"if":[21],"no":[22],"i":[24],"\u2208":[25],"subgraph":[29],"but":[32],"the":[33,47,62],"addition":[34],"an":[36],"arbitrary":[37],"new":[38],"edge":[39],"gives":[40],"subgraph.":[43],"In":[44],"this":[45],"paper":[46],"minimal":[48,65],"number":[49],"edges":[51],"in":[52],"graphs":[54,66,73],"examined.":[56],"General":[57],"estimations":[58],"are":[59],"and":[61],"structure":[63],"described":[68],"for":[69],"some":[70],"special":[71],"(stars,":[74],"paths,":[75],"m":[76],"pairwise":[77],"disjoint":[78],"edges).":[79]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}