{"id":"https://openalex.org/W2139161291","doi":"https://doi.org/10.37236/1553","title":"On Edge Colorings with at Least q Colors in Every Subset of p Vertices","display_name":"On Edge Colorings with at Least q Colors in Every Subset of p Vertices","publication_year":2000,"publication_date":"2000-12-07","ids":{"openalex":"https://openalex.org/W2139161291","doi":"https://doi.org/10.37236/1553","mag":"2139161291"},"language":"en","primary_location":{"id":"doi:10.37236/1553","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1553","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i1r9/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":false,"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":null,"license_id":null,"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":"bronze","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i1r9/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087999366","display_name":"G\u00e1bor N. S\u00e1rk\u00f6zy","orcid":null},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"G\u00e1bor N. S\u00e1rk\u00f6zy","raw_affiliation_strings":["Computer Science Department Worcester Polytechnic Institute Worcester, MA 01609"],"affiliations":[{"raw_affiliation_string":"Computer Science Department Worcester Polytechnic Institute Worcester, MA 01609","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056268263","display_name":"Stanley M. Selkow","orcid":null},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stanley Selkow","raw_affiliation_strings":["Computer Science Department Worcester Polytechnic Institute Worcester, MA 01609"],"affiliations":[{"raw_affiliation_string":"Computer Science Department Worcester Polytechnic Institute Worcester, MA 01609","institution_ids":["https://openalex.org/I107077323"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087999366"],"corresponding_institution_ids":["https://openalex.org/I107077323"],"apc_list":null,"apc_paid":null,"fwci":1.3306,"has_fulltext":true,"cited_by_count":25,"citation_normalized_percentile":{"value":0.79487179,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"8","issue":"1","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.9993000030517578,"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.9993000030517578,"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/T11797","display_name":"graph theory and CDMA systems","score":0.974399983882904,"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.9710000157356262,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.9026132822036743},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8652238845825195},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3557467460632324}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9026132822036743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8652238845825195},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3557467460632324}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.37236/1553","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1553","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i1r9/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":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:digitalcommons.wpi.edu:computerscience-pubs-1095","is_oa":false,"landing_page_url":"https://digitalcommons.wpi.edu/cgi/viewcontent.cgi?article=1095&context=computerscience-pubs","pdf_url":null,"source":{"id":"https://openalex.org/S4377196141","display_name":"Digital WPI","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Faculty Publications","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.22.1925","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.1925","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_8/PostScriptfiles/v8i1r9.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.3381","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3381","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_8/PDF/v8i1r9.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.9039","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.9039","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.wpi.edu/pub/techreports/00-23.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.32.3313","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.3313","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.wpi.edu/pub/techreports/pdf/00-23.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1553","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1553","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i1r9/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":false,"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":null,"license_id":null,"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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2139161291.pdf","grobid_xml":"https://content.openalex.org/works/W2139161291.grobid-xml"},"referenced_works_count":3,"referenced_works":["https://openalex.org/W1510730180","https://openalex.org/W1994434808","https://openalex.org/W2091175510"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596","https://openalex.org/W4238204885"],"abstract_inverted_index":{"For":[0],"fixed":[1,65],"integers":[2],"$p$":[3,25,61,75],"and":[4,55,62,66,94,135],"$q$,":[5],"an":[6],"edge":[7],"coloring":[8],"of":[9,19,24,43,50,130,138,154],"$K_n$":[10,20],"is":[11,90,101,112],"called":[12],"a":[13,47,120,158],"$(p,":[14,48],"q)$-coloring":[15,49],"if":[16,60],"the":[17,40,76,95,107,113,128,133],"edges":[18],"in":[21,92,103,119],"every":[22,74],"subset":[23],"vertices":[26],"are":[27,64],"colored":[28],"with":[29],"at":[30,149],"least":[31],"$q$":[32,63,78,97,115,155],"distinct":[33],"colors.":[34],"Let":[35],"$f(n,":[36],"p,":[37],"q)$":[38],"be":[39],"smallest":[41,77,96],"number":[42],"colors":[44],"needed":[45],"for":[46,73,87,98],"$K_n$.":[51],"In":[52,123,140],"[3]":[53],"Erd\u0151s":[54],"Gy\u00e1rf\u00e1s":[56],"studied":[57],"this":[58,111,124],"function":[59],"$n$":[67,93],"tends":[68],"to":[69],"infinity.":[70],"They":[71,105],"determined":[72],"($=":[79],"{p":[80],"\\choose":[81],"2}":[82],"-":[83],"p":[84],"+":[85],"3$)":[86],"which":[88,99,117,156],"$f(n,p,q)$":[89,100,131],"linear":[91,121,134,159],"quadratic":[102,136],"$n$.":[104],"raised":[106],"question":[108],"whether":[109],"perhaps":[110],"only":[114],"value":[116],"results":[118],"$f(n,p,q)$.":[122,160],"paper":[125],"we":[126,142,146],"study":[127],"behavior":[129],"between":[132],"orders":[137],"magnitude.":[139],"particular":[141],"show":[143],"that":[144,145],"can":[147],"have":[148],"most":[150],"$\\log":[151],"p$":[152],"values":[153],"give":[157]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}