{"id":"https://openalex.org/W2972707657","doi":"https://doi.org/10.1017/s0963548319000178","title":"On the Chromatic Number of Matching Kneser Graphs","display_name":"On the Chromatic Number of Matching Kneser Graphs","publication_year":2019,"publication_date":"2019-09-12","ids":{"openalex":"https://openalex.org/W2972707657","doi":"https://doi.org/10.1017/s0963548319000178","mag":"2972707657"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548319000178","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548319000178","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070993532","display_name":"Meysam Alishahi","orcid":"https://orcid.org/0000-0001-6588-8520"},"institutions":[{"id":"https://openalex.org/I176861719","display_name":"University of Shahrood","ror":"https://ror.org/00yqvtm78","country_code":"IR","type":"education","lineage":["https://openalex.org/I176861719"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Meysam Alishahi","raw_affiliation_strings":["Faculty of Mathematical Sciences, Shahrood University of Technology, Iran","Department of Mathematics University of Shahrood, Iran"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematical Sciences, Shahrood University of Technology, Iran","institution_ids":["https://openalex.org/I176861719"]},{"raw_affiliation_string":"Department of Mathematics University of Shahrood, Iran","institution_ids":["https://openalex.org/I176861719"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053121292","display_name":"Hossein Hajiabolhassan","orcid":"https://orcid.org/0000-0001-8146-9764"},"institutions":[{"id":"https://openalex.org/I48379061","display_name":"Shahid Beheshti University","ror":"https://ror.org/0091vmj44","country_code":"IR","type":"education","lineage":["https://openalex.org/I48379061"]},{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK","IR"],"is_corresponding":true,"raw_author_name":"Hajiabolhassan Hossein","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science, Technical University of Denmark, DK-2800 Lyngby, Denmark","Department of Mathematical Sciences, Shahid Beheshti University, P.O. Box 19839-69411, Tehran, Iran","Department of Mathematical Sciences Shahid Beheshti University, G.C. P.O. Box 19839-63113, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science, Technical University of Denmark, DK-2800 Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"Department of Mathematical Sciences, Shahid Beheshti University, P.O. Box 19839-69411, Tehran, Iran","institution_ids":["https://openalex.org/I48379061"]},{"raw_affiliation_string":"Department of Mathematical Sciences Shahid Beheshti University, G.C. P.O. Box 19839-63113, Tehran, Iran","institution_ids":["https://openalex.org/I48379061"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053121292"],"corresponding_institution_ids":["https://openalex.org/I48379061","https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.14464015,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"29","issue":"1","first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9980000257492065,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9980000257492065,"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.9936000108718872,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.993399977684021,"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.8257175087928772},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.730459451675415},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6033371686935425},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6025040745735168},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5722288489341736},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.5534880757331848},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5315114259719849},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.5110036134719849},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4923590421676636},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4889746904373169},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.44288450479507446},{"id":"https://openalex.org/keywords/odd-graph","display_name":"Odd graph","score":0.438711941242218},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4238094091415405},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4235076308250427},{"id":"https://openalex.org/keywords/permutation-graph","display_name":"Permutation graph","score":0.41502803564071655},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3483877182006836},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.20563000440597534}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8257175087928772},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.730459451675415},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6033371686935425},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6025040745735168},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5722288489341736},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.5534880757331848},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5315114259719849},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.5110036134719849},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4923590421676636},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4889746904373169},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44288450479507446},{"id":"https://openalex.org/C206815938","wikidata":"https://www.wikidata.org/wiki/Q7077445","display_name":"Odd graph","level":5,"score":0.438711941242218},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4238094091415405},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4235076308250427},{"id":"https://openalex.org/C68965932","wikidata":"https://www.wikidata.org/wiki/Q7169369","display_name":"Permutation graph","level":3,"score":0.41502803564071655},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3483877182006836},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.20563000440597534},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548319000178","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548319000178","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/588b1371-d914-492a-bc4f-8b53813db85e","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/588b1371-d914-492a-bc4f-8b53813db85e","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alishahi , M & Hossein , H 2019 , ' On the Chromatic Number of Matching Kneser Graphs ' , Combinatorics Probability and Computing , vol. 29 , no. 1 , pp. 1-21 . https://doi.org/10.1017/S0963548319000178","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W324324708","https://openalex.org/W585142893","https://openalex.org/W1593924207","https://openalex.org/W1963931974","https://openalex.org/W1967316826","https://openalex.org/W1971539651","https://openalex.org/W1985061810","https://openalex.org/W1990568682","https://openalex.org/W1991110565","https://openalex.org/W1995234636","https://openalex.org/W1995457760","https://openalex.org/W2003995429","https://openalex.org/W2014564484","https://openalex.org/W2018724658","https://openalex.org/W2023327064","https://openalex.org/W2030651378","https://openalex.org/W2044721619","https://openalex.org/W2072775530","https://openalex.org/W2093718341","https://openalex.org/W2095145505","https://openalex.org/W2097771028","https://openalex.org/W2106107541","https://openalex.org/W2135552440","https://openalex.org/W2345194624","https://openalex.org/W2408177764","https://openalex.org/W2953006237","https://openalex.org/W2963205604","https://openalex.org/W2963306534","https://openalex.org/W3125099840","https://openalex.org/W3143668074","https://openalex.org/W4236584536"],"related_works":["https://openalex.org/W3130332934","https://openalex.org/W1578023046","https://openalex.org/W2083238533","https://openalex.org/W3123003473","https://openalex.org/W2069553297","https://openalex.org/W416686103","https://openalex.org/W3083738242","https://openalex.org/W1583936408","https://openalex.org/W2059394539","https://openalex.org/W1590991129"],"abstract_inverted_index":{"Abstract":[0],"In":[1,94,127],"an":[2,19],"earlier":[3,101],"paper,":[4,96],"the":[5,10,24,30,111,131,142],"present":[6],"authors":[7],"(2015)":[8],"introduced":[9],"altermatic":[11,31,125],"number":[12,32,113,133,145],"of":[13,23,51,54,76,114,118,134,141,146],"graphs":[14,77,83,86,121,138],"and":[15,62,84,98,106],"used":[16],"Tucker\u2019s":[17],"lemma,":[18],"equivalent":[20],"combinatorial":[21],"version":[22],"Borsuk\u2013Ulam":[25],"theorem,":[26],"to":[27],"prove":[28],"that":[29],"is":[33,44],"a":[34,45,55,59,115],"lower":[35],"bound":[36],"for":[37],"chromatic":[38,112,132],"number.":[39,126],"A":[40],"matching":[41,91,119,136],"Kneser":[42,80,92,120,137],"graph":[43,46,61],"whose":[47],"vertex":[48],"set":[49],"consists":[50],"all":[52],"matchings":[53,70],"specified":[56],"size":[57],"in":[58,139],"host":[60],"two":[63],"vertices":[64],"are":[65,71],"adjacent":[66],"if":[67],"their":[68,124],"corresponding":[69],"edge-disjoint.":[72],"Some":[73],"well-known":[74],"families":[75],"such":[78],"as":[79],"graphs,":[81],"Schrijver":[82,107],"permutation":[85],"can":[87],"be":[88],"represented":[89],"by":[90,103,122],"graphs.":[93],"this":[95],"unifying":[97],"generalizing":[99],"some":[100],"works":[102],"Lov\u00e1sz":[104],"(1978)":[105],"(1978),":[108],"we":[109,129],"determine":[110,130],"large":[116],"family":[117],"specifying":[123],"particular,":[128],"these":[135],"terms":[140],"generalized":[143],"Tur\u00e1n":[144],"matchings.":[147]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}