{"id":"https://openalex.org/W3083876857","doi":"https://doi.org/10.37236/9851","title":"Guessing Numbers and Extremal Graph Theory","display_name":"Guessing Numbers and Extremal Graph Theory","publication_year":2022,"publication_date":"2022-06-16","ids":{"openalex":"https://openalex.org/W3083876857","doi":"https://doi.org/10.37236/9851","mag":"3083876857"},"language":"en","primary_location":{"id":"doi:10.37236/9851","is_oa":true,"landing_page_url":"https://doi.org/10.37236/9851","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v29i2p58/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":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v29i2p58/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021600718","display_name":"Jo Ryder Martin","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jo Martin","raw_affiliation_strings":["Department of Mathematics and Statistics","University of Vermont Burlington, VT, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics","institution_ids":[]},{"raw_affiliation_string":"University of Vermont Burlington, VT, U.S.A","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066057526","display_name":"Puck Rombach","orcid":"https://orcid.org/0000-0002-8374-0797"},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Puck Rombach","raw_affiliation_strings":["University of Vermont"],"affiliations":[{"raw_affiliation_string":"University of Vermont","institution_ids":["https://openalex.org/I111236770"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021600718"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1381,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.42596026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"29","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9987000226974487,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9925000071525574,"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/T11130","display_name":"Coding theory and cryptography","score":0.9865000247955322,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8566427826881409},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.805513858795166},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.6089972257614136},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5030426383018494},{"id":"https://openalex.org/keywords/critical-graph","display_name":"Critical graph","score":0.46073171496391296},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.4594823122024536},{"id":"https://openalex.org/keywords/extremal-graph-theory","display_name":"Extremal graph theory","score":0.412984162569046},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3795959949493408},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34080585837364197},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.1915486752986908},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.18312838673591614}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8566427826881409},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.805513858795166},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6089972257614136},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5030426383018494},{"id":"https://openalex.org/C167750561","wikidata":"https://www.wikidata.org/wiki/Q1789512","display_name":"Critical graph","level":5,"score":0.46073171496391296},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.4594823122024536},{"id":"https://openalex.org/C12595997","wikidata":"https://www.wikidata.org/wiki/Q739245","display_name":"Extremal graph theory","level":5,"score":0.412984162569046},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3795959949493408},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34080585837364197},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.1915486752986908},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.18312838673591614},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/9851","is_oa":true,"landing_page_url":"https://doi.org/10.37236/9851","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v29i2p58/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"}],"best_oa_location":{"id":"doi:10.37236/9851","is_oa":true,"landing_page_url":"https://doi.org/10.37236/9851","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v29i2p58/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":[{"score":0.6299999952316284,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3083876857.pdf","grobid_xml":"https://content.openalex.org/works/W3083876857.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W197010697","https://openalex.org/W776158984","https://openalex.org/W788200807","https://openalex.org/W1563286165","https://openalex.org/W1650455072","https://openalex.org/W1990490082","https://openalex.org/W1992511794","https://openalex.org/W1995875735","https://openalex.org/W2004159513","https://openalex.org/W2004751842","https://openalex.org/W2045203810","https://openalex.org/W2065758258","https://openalex.org/W2105831729","https://openalex.org/W2133251572","https://openalex.org/W2151919492","https://openalex.org/W2161173317","https://openalex.org/W2963103460","https://openalex.org/W2964251177","https://openalex.org/W2993383518"],"related_works":["https://openalex.org/W4299307887","https://openalex.org/W2952803432","https://openalex.org/W4386907017","https://openalex.org/W1980424184","https://openalex.org/W2076599430","https://openalex.org/W2183721992","https://openalex.org/W1190343205","https://openalex.org/W32000569","https://openalex.org/W153309283","https://openalex.org/W1647716320"],"abstract_inverted_index":{"For":[0],"a":[1,11,75,126,143,156],"given":[2],"number":[3,9,71,97,106,121,145,151],"of":[4,10,18,21,25,27,31,38,47,72,81,103,146,159],"colors,":[5,147],"$s$,":[6],"the":[7,14,19,22,28,32,36,45,48,69,79,89,95,101,119,149],"guessing":[8,70,105,150],"graph":[12,33,65,76],"is":[13,55,152],"(base":[15],"$s$)":[16],"logarithm":[17],"cardinality":[20],"largest":[23],"family":[24],"colorings":[26],"vertex":[29,40],"set":[30,158],"such":[34],"that":[35,133],"color":[37],"each":[39],"can":[41],"be":[42],"determined":[43],"from":[44],"colors":[46],"vertices":[49],"in":[50,59,78],"its":[51,86],"neighborhood.":[52],"This":[53],"quantity":[54],"related":[56],"to":[57,88,100,128,154],"problems":[58],"network":[60],"coding,":[61],"circuit":[62],"complexity":[63],"and":[64,85,125],"entropy.":[66],"We":[67,93,139],"study":[68],"graphs":[73,132],"as":[74],"property":[77,102],"context":[80],"classic":[82],"extremal":[83,96],"questions,":[84],"relationship":[87],"forbidden":[90],"subgraph":[91],"property.":[92],"find":[94,114],"with":[98],"respect":[99],"having":[104],"$\\leq":[107],"a$,":[108],"for":[109,122,142],"fixed":[110,144],"$a$.":[111],"Furthermore,":[112],"we":[113],"an":[115],"upper":[116],"bound":[117],"on":[118],"saturation":[120],"this":[123],"property,":[124],"method":[127],"construct":[129],"further":[130],"saturated":[131],"lie":[134],"between":[135],"these":[136],"two":[137],"extremes.":[138],"show":[140],"that,":[141],"bounding":[148],"equivalent":[153],"forbidding":[155],"finite":[157],"subgraphs.":[160]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}