{"id":"https://openalex.org/W2465085377","doi":"https://doi.org/10.37236/5628","title":"Modeling Limits in Hereditary Classes: Reduction and Application to Trees","display_name":"Modeling Limits in Hereditary Classes: Reduction and Application to Trees","publication_year":2016,"publication_date":"2016-06-24","ids":{"openalex":"https://openalex.org/W2465085377","doi":"https://doi.org/10.37236/5628","mag":"2465085377"},"language":"en","primary_location":{"id":"doi:10.37236/5628","is_oa":true,"landing_page_url":"https://doi.org/10.37236/5628","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v23i2p52/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v23i2p52/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070558406","display_name":"Jaroslav Ne\u0161et\u0159il","orcid":"https://orcid.org/0000-0002-5133-5586"},"institutions":[{"id":"https://openalex.org/I4210151249","display_name":"Karlovac University of Applied Sciences","ror":"https://ror.org/04y50an90","country_code":"HR","type":"education","lineage":["https://openalex.org/I4210151249"]}],"countries":["HR"],"is_corresponding":false,"raw_author_name":"Jaroslav Ne\u0161et\u0159il","raw_affiliation_strings":["Univerzita Karlova v Praze"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univerzita Karlova v Praze","institution_ids":["https://openalex.org/I4210151249"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004397700","display_name":"Patrice Ossona de Mendez","orcid":"https://orcid.org/0000-0003-0724-3729"},"institutions":[{"id":"https://openalex.org/I4210089144","display_name":"Centre National pour la Recherche Scientifique et Technique (CNRST)","ror":"https://ror.org/00675rp98","country_code":"MA","type":"government","lineage":["https://openalex.org/I4210089144"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Patrice Ossona de Mendez","raw_affiliation_strings":["Centre National de la Recherche Scientifique - and - Univerzita Karlova v Praze"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre National de la Recherche Scientifique - and - Univerzita Karlova v Praze","institution_ids":["https://openalex.org/I4210089144"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2441,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.9241908,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"23","issue":"2","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.9988999962806702,"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.9988999962806702,"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/T11476","display_name":"Graph theory and applications","score":0.988099992275238,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9818999767303467,"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/mathematics","display_name":"Mathematics","score":0.8313795328140259},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7938269376754761},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.7305185794830322},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6792482733726501},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6687366366386414},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.614216148853302},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6004475951194763},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5367860198020935},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5206264853477478},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5009331703186035},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.4517795145511627},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.25695669651031494},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.15286916494369507},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12554526329040527},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09678918123245239},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09645289182662964}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8313795328140259},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7938269376754761},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.7305185794830322},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6792482733726501},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6687366366386414},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.614216148853302},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6004475951194763},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5367860198020935},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5206264853477478},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5009331703186035},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.4517795145511627},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.25695669651031494},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.15286916494369507},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12554526329040527},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09678918123245239},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09645289182662964},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/5628","is_oa":true,"landing_page_url":"https://doi.org/10.37236/5628","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v23i2p52/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1312.0441","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1312.0441","pdf_url":"https://arxiv.org/pdf/1312.0441","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"}],"best_oa_location":{"id":"doi:10.37236/5628","is_oa":true,"landing_page_url":"https://doi.org/10.37236/5628","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v23i2p52/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2465085377.pdf","grobid_xml":"https://content.openalex.org/works/W2465085377.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W273178449","https://openalex.org/W301673084","https://openalex.org/W1517150411","https://openalex.org/W1539382740","https://openalex.org/W1552703577","https://openalex.org/W1597233009","https://openalex.org/W1759318922","https://openalex.org/W1815738779","https://openalex.org/W2039898566","https://openalex.org/W2082734581","https://openalex.org/W2099898495","https://openalex.org/W2110596924","https://openalex.org/W2112212574","https://openalex.org/W2285002042","https://openalex.org/W2320083918","https://openalex.org/W2599394021","https://openalex.org/W4245875350"],"related_works":["https://openalex.org/W4301895170","https://openalex.org/W3194471551","https://openalex.org/W2163760347","https://openalex.org/W2963936214","https://openalex.org/W4375956809","https://openalex.org/W1581373162","https://openalex.org/W2784911598","https://openalex.org/W3013085049","https://openalex.org/W2610026222","https://openalex.org/W2277535896"],"abstract_inverted_index":{"The":[0,47,81],"study":[1],"of":[2,4,45,49,67,69,75,87,94,138],"limits":[3,51],"graphs":[5,76,95],"led":[6],"to":[7,36,42,64,126],"elegant":[8],"limit":[9,89],"structures":[10],"for":[11,54,84,90],"sparse":[12],"and":[13,20,33,41,74,101],"dense":[14,99],"graphs.":[15],"This":[16],"has":[17,103],"been":[18,104],"unified":[19],"generalized":[21],"by":[22],"the":[23,43,65,85,97,136],"authors":[24],"in":[25,56,62],"a":[26,57,91,109,123],"more":[27],"general":[28,119],"setting":[29],"combining":[30],"analytic":[31],"tools":[32],"model":[34],"theory":[35],"${\\rm":[37],"FO}$-limits":[38],"(and":[39],"$X$-limits)":[40],"notion":[44],"modeling.":[46],"existence":[48,86],"modeling":[50,88,143],"was":[52],"established":[53],"sequences":[55],"bounded":[58,72,78],"degree":[59],"class":[60,93,137],"and,":[61],"addition,":[63],"case":[66],"classes":[68],"trees":[70,141],"with":[71,77],"height":[73],"tree":[79],"depth.":[80],"natural":[82],"obstacle":[83],"monotone":[92],"is":[96,108],"nowhere":[98],"property":[100],"it":[102],"conjectured":[105],"that":[106,135],"this":[107,127],"sufficient":[110],"condition.":[111],"Extending":[112],"earlier":[113],"results":[114,120],"here":[115],"we":[116,132],"derive":[117],"several":[118],"which":[121],"present":[122],"realistic":[124],"approach":[125],"conjecture.":[128],"As":[129],"an":[130],"example":[131],"then":[133],"prove":[134],"all":[139],"finite":[140],"admits":[142],"limits.":[144]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}