{"id":"https://openalex.org/W4414785307","doi":"https://doi.org/10.37236/12703","title":"On Vizing\u2019s Problem for Triangle-Free Graphs","display_name":"On Vizing\u2019s Problem for Triangle-Free Graphs","publication_year":2025,"publication_date":"2025-10-03","ids":{"openalex":"https://openalex.org/W4414785307","doi":"https://doi.org/10.37236/12703"},"language":"en","primary_location":{"id":"doi:10.37236/12703","is_oa":true,"landing_page_url":"https://doi.org/10.37236/12703","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p3/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/v32i4p3/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019911064","display_name":"Ross J. Kang","orcid":"https://orcid.org/0000-0002-4219-593X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ross J. Kang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5038414386","display_name":"Matthieu Rosenfeld","orcid":"https://orcid.org/0000-0001-5467-5407"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthieu Rosenfeld","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3809376,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.98089998960495,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.98089998960495,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9733999967575073,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.958299994468689,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/graph","display_name":"Graph","score":0.5315999984741211},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.38999998569488525},{"id":"https://openalex.org/keywords/argument","display_name":"Argument (complex analysis)","score":0.34470000863075256},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.3310999870300293},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.2700999975204468}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6134999990463257},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.546500027179718},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5315999984741211},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44510000944137573},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.38999998569488525},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.34470000863075256},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3188000023365021},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.2700999975204468},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.24150000512599945}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.37236/12703","is_oa":true,"landing_page_url":"https://doi.org/10.37236/12703","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p3/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:dare.uva.nl:openaire/cfee8b05-c0ba-4b2e-ac07-a529222a87c1","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/on-vizings-problem-for-trianglefree-graphs(cfee8b05-c0ba-4b2e-ac07-a529222a87c1).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kang, R J & Rosenfeld, M 2025, 'On Vizing\u2019s problem for triangle-free graphs', Electronic Journal of Combinatorics, vol. 32, no. 4, P4.3. https://doi.org/10.37236/12703","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:hal-05655502v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05655502","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"The Electronic Journal of Combinatorics, 2025, 32 (4), pp.4.3. ⟨10.37236/12703⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.37236/12703","is_oa":true,"landing_page_url":"https://doi.org/10.37236/12703","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p3/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":[{"id":"https://openalex.org/G7830895999","display_name":null,"funder_award_id":"024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G8688676036","display_name":"On the edge: theory and techniques at the frontiers of edge-colouring","funder_award_id":"639.032.614","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4414785307.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,36],"prove":[1],"that":[2],"$\\chi(G)":[3],"\\le":[4],"\\lceil":[5],"(\\Delta+1)/2\\rceil+1$":[6],"for":[7],"any":[8],"triangle-free":[9],"graph":[10],"$G$":[11],"of":[12,28,40,53],"maximum":[13],"degree":[14],"$\\Delta$":[15],"provided":[16],"$\\Delta":[17],"\\ge":[18],"524$.":[19],"This":[20],"gives":[21],"tangible":[22],"progress":[23],"towards":[24],"an":[25],"old":[26],"problem":[27],"Vizing,":[29],"in":[30,45],"a":[31,38,49],"form":[32],"cast":[33],"by":[34],"Reed.":[35],"use":[37],"method":[39],"Hurley":[41],"and":[42],"Pirot,":[43],"which":[44],"turn":[46],"relies":[47],"on":[48],"new":[50],"counting":[51],"argument":[52],"the":[54],"second":[55],"author.":[56]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}