{"id":"https://openalex.org/W7106553875","doi":"https://doi.org/10.1016/j.procs.2025.10.281","title":"Lower Bounds for Induced-Universal Graphs","display_name":"Lower Bounds for Induced-Universal Graphs","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7106553875","doi":"https://doi.org/10.1016/j.procs.2025.10.281"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2025.10.281","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.281","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.procs.2025.10.281","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Cyril Gavoille","orcid":null},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Cyril Gavoille","raw_affiliation_strings":["LaBRI, University of Bordeaux, France"],"affiliations":[{"raw_affiliation_string":"LaBRI, University of Bordeaux, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]}]},{"author_position":"last","author":{"id":null,"display_name":"Amaury Jacques","orcid":null},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Amaury Jacques","raw_affiliation_strings":["LaBRI, University of Bordeaux, France"],"affiliations":[{"raw_affiliation_string":"LaBRI, University of Bordeaux, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.51625266,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"273","issue":null,"first_page":"62","last_page":"69"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.6140000224113464,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.6140000224113464,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.14650000631809235,"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.09960000216960907,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6085000038146973},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.5277000069618225},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.49000000953674316},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46070000529289246},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44519999623298645},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.39890000224113464},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3637999892234802},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.34540000557899475}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8183000087738037},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6085000038146973},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.5277000069618225},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.49000000953674316},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4878000020980835},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48069998621940613},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46070000529289246},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44519999623298645},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.39890000224113464},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3637999892234802},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.34540000557899475},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34279999136924744},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.326200008392334},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.3257000148296356},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.3224000036716461},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.3091000020503998},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.30869999527931213},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.30480000376701355},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.2971999943256378},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.27309998869895935},{"id":"https://openalex.org/C121134508","wikidata":"https://www.wikidata.org/wiki/Q4949882","display_name":"Bound graph","level":5,"score":0.2639000117778778},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.25929999351501465},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.2567000091075897}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2025.10.281","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.281","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2025.10.281","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.281","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1487816497","https://openalex.org/W1498990067","https://openalex.org/W1589957632","https://openalex.org/W1967546560","https://openalex.org/W1999600491","https://openalex.org/W2024781825","https://openalex.org/W2041588219","https://openalex.org/W2054926432","https://openalex.org/W2058824702","https://openalex.org/W2060963839","https://openalex.org/W2073593086","https://openalex.org/W2077571023","https://openalex.org/W2084709397","https://openalex.org/W2085348754","https://openalex.org/W2096481849","https://openalex.org/W2130186928","https://openalex.org/W2136086442","https://openalex.org/W2157109975","https://openalex.org/W2252330517","https://openalex.org/W2319000796","https://openalex.org/W2586156068","https://openalex.org/W2908688288","https://openalex.org/W2980410956","https://openalex.org/W3019053352","https://openalex.org/W3204812806","https://openalex.org/W4205545339","https://openalex.org/W4205720944","https://openalex.org/W4229647732"],"related_works":[],"abstract_inverted_index":{"We":[0,49],"give":[1],"a":[2,16,23,127,184],"series":[3],"of":[4,12,22,55,76,82,134,137,175],"new":[5],"lower":[6,65,101],"bounds":[7],"on":[8],"the":[9,53,96,168],"minimum":[10],"number":[11,54,143],"vertices":[13,84,139],"required":[14],"by":[15,182],"graph":[17,21,36,88,109,155],"to":[18,58,62],"contain":[19],"every":[20],"given":[24],"family":[25,75,133,174],"as":[26],"induced":[27],"subgraph.":[28],"In":[29,71],"particular,":[30],"we":[31,129],"show":[32,51,130],"that":[33,52,131],"this":[34,64],"induced-universal":[35,87,154],"for":[37,107,172],"n":[38,47,83,93,138,165],"-vertex":[39],"planar":[40,80],"graphs":[41,57,81,136],"must":[42],"have":[43],"at":[44,68],"least":[45,69],"10.52":[46,92],"vertices.":[48,161],"also":[50],"conflicting":[56],"consider":[59],"in":[60,98],"order":[61],"beat":[63],"bound":[66,169],"is":[67],"137.":[70],"other":[72,108],"words,":[73],"any":[74,132,148,173],"less":[77,90,157],"than":[78,91,158],"137":[79],"has":[85,152],"an":[86,153],"with":[89,156],"vertices,":[94],"stressing":[95],"difficulty":[97],"beating":[99],"such":[100],"bounds.":[102],"Similar":[103],"results":[104,179],"are":[105,180],"developed":[106],"families,":[110],"including":[111],"but":[112],"not":[113],"limited":[114],"to,":[115],"trees,":[116],"outerplanar":[117],"graphs,":[118,120],"series-parallel":[119],"K":[121],"3,3":[122],"-minor":[123],"free":[124],"graphs.":[125,177],"As":[126],"byproduct,":[128],"t":[135,163,176],"having":[140],"small":[141],"chromatic":[142],"and":[144,191],"sublinear":[145],"pathwidth,":[146],"like":[147],"proper":[149],"minor-closed":[150],"family,":[151],"15/7":[159],"\u221at\u22c5n":[160],"If":[162],"\u2a7e":[164],"2":[166],",":[167],"actually":[170],"holds":[171],"Our":[178],"achieved":[181],"making":[183],"bridge":[185],"between":[186],"equitable":[187],"colorings,":[188],"combinatorial":[189],"designs,":[190],"path-decompositions.":[192]},"counts_by_year":[],"updated_date":"2026-01-20T17:24:06.736184","created_date":"2025-11-25T00:00:00"}