{"id":"https://openalex.org/W1982114488","doi":"https://doi.org/10.1007/s004930200024","title":"On Erd\u0151s's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6","display_name":"On Erd\u0151s's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6","publication_year":2002,"publication_date":"2002-07-01","ids":{"openalex":"https://openalex.org/W1982114488","doi":"https://doi.org/10.1007/s004930200024","mag":"1982114488"},"language":"en","primary_location":{"id":"doi:10.1007/s004930200024","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004930200024","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","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/A5025523396","display_name":"Franti\u0161ek Fran\u011bk","orcid":"https://orcid.org/0000-0002-4110-2113"},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["AT","CA"],"is_corresponding":true,"raw_author_name":"Frantisek Franek","raw_affiliation_strings":["Algorithms Research Group, Department of Computing & Software, McMaster University; Hamilton, Ontario L8S 4L7, Canada;","Algorithms Research Group, Department of Computing & Software, McMaster University","Hamilton, Ontario L8S 4L7, Canada"],"affiliations":[{"raw_affiliation_string":"Algorithms Research Group, Department of Computing & Software, McMaster University; Hamilton, Ontario L8S 4L7, Canada;","institution_ids":["https://openalex.org/I98251732"]},{"raw_affiliation_string":"Algorithms Research Group, Department of Computing & Software, McMaster University","institution_ids":["https://openalex.org/I4210099593","https://openalex.org/I98251732"]},{"raw_affiliation_string":"Hamilton, Ontario L8S 4L7, Canada","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025523396"],"corresponding_institution_ids":["https://openalex.org/I4210099593","https://openalex.org/I98251732"],"apc_list":null,"apc_paid":null,"fwci":0.5563,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.55484988,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"22","issue":"3","first_page":"451","last_page":"454"},"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.9983999729156494,"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.9983999729156494,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9918000102043152,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9898999929428101,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8674046993255615},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8217490911483765},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7699109315872192},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6331028342247009},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3571881949901581}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8674046993255615},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8217490911483765},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7699109315872192},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6331028342247009},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3571881949901581},{"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.1007/s004930200024","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004930200024","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2100698087"],"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":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-01-15T23:16:33.117629","created_date":"2025-10-10T00:00:00"}