{"id":"https://openalex.org/W197010697","doi":"https://doi.org/10.37236/4731","title":"Guessing Games on Triangle-Free Graphs","display_name":"Guessing Games on Triangle-Free Graphs","publication_year":2016,"publication_date":"2016-03-18","ids":{"openalex":"https://openalex.org/W197010697","doi":"https://doi.org/10.37236/4731","mag":"197010697"},"language":"en","primary_location":{"id":"doi:10.37236/4731","is_oa":true,"landing_page_url":"https://doi.org/10.37236/4731","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v23i1p48/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/v23i1p48/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048639170","display_name":"Peter J\u200e. Cameron","orcid":"https://orcid.org/0000-0003-3130-9505"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Peter J. Cameron","raw_affiliation_strings":["School of Mathematical Sciences, Queen Mary, University of London, London, E1 4NS, U.K"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Queen Mary, University of London, London, E1 4NS, U.K","institution_ids":["https://openalex.org/I166337079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020830916","display_name":"Anh N. Dang","orcid":"https://orcid.org/0009-0007-1090-5945"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anh N. Dang","raw_affiliation_strings":["Queen Mary University"],"affiliations":[{"raw_affiliation_string":"Queen Mary University","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005137861","display_name":"S\u00f8ren Riis","orcid":"https://orcid.org/0000-0003-0697-4116"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"S\u00f8ren Riis","raw_affiliation_strings":["School of Electronic Engineering and Computer Science, Queen Mary, University of London, London, E1 4NS, U.K"],"affiliations":[{"raw_affiliation_string":"School of Electronic Engineering and Computer Science, Queen Mary, University of London, London, E1 4NS, U.K","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5005137861"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6969,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.72131198,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"23","issue":"1","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.9995999932289124,"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.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"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.9944999814033508,"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/combinatorics","display_name":"Combinatorics","score":0.8729766011238098},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7670071125030518},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.7201140522956848},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5922032594680786},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5228767395019531},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5143840909004211},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4604315161705017},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4390888810157776}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8729766011238098},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7670071125030518},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.7201140522956848},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5922032594680786},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5228767395019531},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5143840909004211},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4604315161705017},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4390888810157776},{"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/4731","is_oa":true,"landing_page_url":"https://doi.org/10.37236/4731","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v23i1p48/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/4731","is_oa":true,"landing_page_url":"https://doi.org/10.37236/4731","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v23i1p48/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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W197010697.pdf","grobid_xml":"https://content.openalex.org/works/W197010697.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W40390228","https://openalex.org/W131912969","https://openalex.org/W1563286165","https://openalex.org/W1650455072","https://openalex.org/W1672833098","https://openalex.org/W2056466085","https://openalex.org/W2065758258","https://openalex.org/W2067298912","https://openalex.org/W2099111195","https://openalex.org/W2104034609","https://openalex.org/W2105831729","https://openalex.org/W2113940092","https://openalex.org/W2119442443","https://openalex.org/W2135700940","https://openalex.org/W2151919492","https://openalex.org/W2166988804","https://openalex.org/W2401610261","https://openalex.org/W2478708596","https://openalex.org/W2949976887","https://openalex.org/W4300071968"],"related_works":["https://openalex.org/W4287184894","https://openalex.org/W3157268033","https://openalex.org/W2995136638","https://openalex.org/W197010697","https://openalex.org/W1971052845","https://openalex.org/W2963698099","https://openalex.org/W2118748668","https://openalex.org/W4298167438","https://openalex.org/W2230939543","https://openalex.org/W2952315311"],"abstract_inverted_index":{"The":[0],"guessing":[1,45,51,89,152,171],"game":[2,19,52],"introduced":[3,80],"by":[4,184],"Riis":[5],"[Electron.":[6,76],"J.":[7,77],"Combin.":[8,78],"2007]":[9],"is":[10,38,71,111,188],"a":[11,43,81],"variant":[12],"of":[13,87,129],"the":[14,50,59,68,85,88,94,121,130,158,165,181],"\"guessing":[15],"your":[16],"own":[17],"hats\"":[18],"and":[20,74,176],"can":[21],"be":[22,63],"played":[23,53],"on":[24,30,54],"any":[25],"simple":[26],"directed":[27,60],"graph":[28,69,124,169],"$G$":[29,70,125],"$n$":[31],"vertices.":[32],"For":[33],"each":[34],"digraph":[35],"$G$,":[36],"it":[37,110],"proved":[39],"that":[40,114,145,150],"there":[41,146],"exists":[42],"unique":[44],"number":[46,90,98,172],"$\\mathrm{gn}(G)$":[47],"associated":[48],"to":[49,62,83],"$G$.":[55],"When":[56],"we":[57,143],"consider":[58],"edge":[61],"bidirected,":[64],"in":[65,117],"other":[66],"words,":[67],"undirected,":[72],"Christofides":[73],"Markstr\u00f6m":[75],"2011]":[79],"method":[82],"bound":[84,119,182],"value":[86],"from":[91],"below":[92],"using":[93],"fractional":[95,159,185],"clique":[96,160,186],"cover":[97,161,187],"$\\kappa_f(G)$.":[99],"In":[100,140,163],"particular":[101],"they":[102],"showed":[103],"$\\mathrm{gn}(G)":[104],"\\geq":[105],"|V(G)|":[106],"-":[107],"\\kappa_f(G)$.":[108],"Moreover,":[109],"pointed":[112],"out":[113],"equality":[115],"holds":[116],"this":[118,141],"if":[120],"underlying":[122],"undirected":[123],"falls":[126],"into":[127],"one":[128],"following":[131],"categories:":[132],"perfect":[133],"graphs,":[134],"cycle":[135],"graphs":[136,149],"or":[137],"their":[138],"complement.":[139],"paper,":[142],"show":[144],"are":[147],"triangle-free":[148,167],"have":[151],"numbers":[153],"which":[154],"do":[155],"not":[156],"meet":[157],"bound.":[162],"particular,":[164],"famous":[166],"Higman-Sims":[168],"has":[170],"at":[173,177],"least":[174],"$77$":[175],"most":[178],"$78$,":[179],"while":[180],"given":[183],"$50$.":[189]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}