{"id":"https://openalex.org/W4409893992","doi":"https://doi.org/10.71352/ac.48.199","title":"A clique size estimate based on coloring the nodes of certain subgraphs","display_name":"A clique size estimate based on coloring the nodes of certain subgraphs","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W4409893992","doi":"https://doi.org/10.71352/ac.48.199"},"language":"en","primary_location":{"id":"doi:10.71352/ac.48.199","doi":"https://doi.org/10.71352/ac.48.199","is_oa":true,"landing_page_url":"https://doi.org/10.71352/ac.48.199","pdf_url":"https://ac.inf.elte.hu/Vol_048_2018/doi/199_48.pdf","source":{"id":"https://openalex.org/S5406929889","display_name":"Annales Universitatis Scientiarum Budapestinensis de Rolando E\u00f6tv\u00f6s Nominatae Sectio computatorica","issn_l":"0138-9491","issn":["0138-9491","3058-0811"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annales Universitatis Scientiarum Budapestinensis de Rolando E\u00f6tv\u00f6s Nominatae. Sectio computatorica","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://ac.inf.elte.hu/Vol_048_2018/doi/199_48.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084701586","display_name":"S\u00e1ndor Szab\u00f3","orcid":"https://orcid.org/0000-0002-4396-3785","observed_orcids":["https://orcid.org/0000-0002-4396-3785"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"S\u00e1ndor Szab\u00f3","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5084701586"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":"48","first_page":"199","last_page":"208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5684000253677368,"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.5684000253677368,"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.392300009727478,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.01360000018030405,"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/clique-number","display_name":"clique number","score":0.7149999737739563},{"id":"https://openalex.org/keywords/maximum-clique-problem","display_name":"maximum clique problem","score":0.699999988079071},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"greedy coloring","score":0.6320000290870667},{"id":"https://openalex.org/keywords/node-coloring","display_name":"node coloring","score":0.718999981880188},{"id":"https://openalex.org/keywords/subgraphs","display_name":"subgraphs","score":0.8330000042915344},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"graph coloring","score":0.4339999854564667}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.8125754594802856},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4884887933731079},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.4857616722583771},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.47442737221717834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46880558133125305},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38644999265670776},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.04842457175254822},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.71352/ac.48.199","doi":"https://doi.org/10.71352/ac.48.199","is_oa":true,"landing_page_url":"https://doi.org/10.71352/ac.48.199","pdf_url":"https://ac.inf.elte.hu/Vol_048_2018/doi/199_48.pdf","source":{"id":"https://openalex.org/S5406929889","display_name":"Annales Universitatis Scientiarum Budapestinensis de Rolando E\u00f6tv\u00f6s Nominatae Sectio computatorica","issn_l":"0138-9491","issn":["0138-9491","3058-0811"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annales Universitatis Scientiarum Budapestinensis de Rolando E\u00f6tv\u00f6s Nominatae. Sectio computatorica","raw_type":"journal-article"},{"id":"pmh:oai:edit.elte.hu:10831/120838","doi":null,"is_oa":true,"landing_page_url":"https://edit.elte.hu/bitstreams/077bed6c-ca19-4f7e-9998-667966a5fb3d/download","pdf_url":"https://edit.elte.hu/xmlui/bitstream/10831/120838/1/Sectio.Computatorica.vol48.199-208.pdf","source":{"id":"https://openalex.org/S4306400126","display_name":"ELTE Digital Institutional Repository (EDIT) (E\u00f6tv\u00f6s Lor\u00e1nd University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I106118109","host_organization_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","host_organization_lineage":["https://openalex.org/I106118109"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.71352/ac.48.199","doi":"https://doi.org/10.71352/ac.48.199","is_oa":true,"landing_page_url":"https://doi.org/10.71352/ac.48.199","pdf_url":"https://ac.inf.elte.hu/Vol_048_2018/doi/199_48.pdf","source":{"id":"https://openalex.org/S5406929889","display_name":"Annales Universitatis Scientiarum Budapestinensis de Rolando E\u00f6tv\u00f6s Nominatae Sectio computatorica","issn_l":"0138-9491","issn":["0138-9491","3058-0811"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annales Universitatis Scientiarum Budapestinensis de Rolando E\u00f6tv\u00f6s Nominatae. Sectio computatorica","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4409893992.pdf","grobid_xml":"https://content.openalex.org/works/W4409893992.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2911026293","https://openalex.org/W4399973995","https://openalex.org/W2790406481","https://openalex.org/W3160419198","https://openalex.org/W3193098091","https://openalex.org/W2009789570","https://openalex.org/W7096236316","https://openalex.org/W54043822","https://openalex.org/W1990516481","https://openalex.org/W7096536287"],"abstract_inverted_index":{"Many":[0],"of":[1,17,21,57],"the":[2,18,33,48,55],"maximum":[3],"clique":[4,19,49,73],"search":[5],"algorithms":[6],"used":[7],"in":[8,35],"practice":[9],"employ":[10],"a":[11,22,44,72],"routine":[12],"to":[13,71],"establish":[14],"upper":[15,25,45,75],"estimate":[16,46],"size":[20,74],"given":[23],"graph.The":[24],"estimates":[26],"are":[27,60,68],"typically":[28],"based":[29],"on":[30],"legally":[31,62],"coloring":[32,53],"nodes":[34,56],"some":[36],"greedy":[37,52],"manner.Motivated":[38],"by":[39],"these":[40,65],"facts":[41],"we":[42],"propose":[43],"for":[47],"number.Using":[50],"any":[51],"procedure":[54],"many":[58],"subgraphs":[59],"colored":[61],"and":[63],"then":[64],"partial":[66],"results":[67],"combined":[69],"together":[70],"estimate.":[76]},"counts_by_year":[],"updated_date":"2026-09-11T09:22:31.653822","created_date":"2025-04-29T00:00:00"}