{"id":"https://openalex.org/W2004176302","doi":"https://doi.org/10.1017/s0963548303005698","title":"A Note on Explicit Ramsey Graphs and Modular Sieves","display_name":"A Note on Explicit Ramsey Graphs and Modular Sieves","publication_year":2003,"publication_date":"2003-11-01","ids":{"openalex":"https://openalex.org/W2004176302","doi":"https://doi.org/10.1017/s0963548303005698","mag":"2004176302"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548303005698","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548303005698","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/A5052560792","display_name":"Vince Grolmusz","orcid":"https://orcid.org/0000-0001-9456-8876"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Vince Grolmusz","raw_affiliation_strings":["Department of Computer Science, E\u00f6tv\u00f6s University, P\u00e1zm\u00e1ny P\u00e9ter S\u00e9t\u00e1ny 1/C, H-1117 Budapest, Hungary","Department of Computer Science, E\u00f6tv\u00f6s University, P\u00e1zm\u00e1ny P\u00e9ter S\u00e9t\u00e1ny 1/C, H-1117 Budapest, Hungary (e-mail: grolmusz@cs.elte.hu)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, E\u00f6tv\u00f6s University, P\u00e1zm\u00e1ny P\u00e9ter S\u00e9t\u00e1ny 1/C, H-1117 Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]},{"raw_affiliation_string":"Department of Computer Science, E\u00f6tv\u00f6s University, P\u00e1zm\u00e1ny P\u00e9ter S\u00e9t\u00e1ny 1/C, H-1117 Budapest, Hungary (e-mail: grolmusz@cs.elte.hu)#TAB#","institution_ids":["https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052560792"],"corresponding_institution_ids":["https://openalex.org/I106118109"],"apc_list":null,"apc_paid":null,"fwci":0.5519,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.60190763,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"12","issue":"5-6","first_page":"565","last_page":"569"},"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.9986000061035156,"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.9986000061035156,"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.9973000288009644,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9972000122070312,"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/diagonal","display_name":"Diagonal","score":0.8037905693054199},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.6406872272491455},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6295669078826904},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6225498914718628},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5255488157272339},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4615694284439087},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4125370979309082},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39600706100463867},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2360754907131195}],"concepts":[{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.8037905693054199},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.6406872272491455},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6295669078826904},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6225498914718628},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5255488157272339},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4615694284439087},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4125370979309082},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39600706100463867},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2360754907131195},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548303005698","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548303005698","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:CiteSeerX.psu:10.1.1.13.7845","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.7845","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.elte.hu/~grolmusz/papers/MODSIE2.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.64.7908","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.7908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.elte.hu/~grolmusz/papers/MODSIE2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.47999998927116394,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W319743603","https://openalex.org/W2045472305","https://openalex.org/W2054996571","https://openalex.org/W2064197162","https://openalex.org/W2069582894","https://openalex.org/W2154781247"],"related_works":["https://openalex.org/W2135584473","https://openalex.org/W2964223869","https://openalex.org/W2626141450","https://openalex.org/W2114045837","https://openalex.org/W2792539140","https://openalex.org/W2378076731","https://openalex.org/W2005808740","https://openalex.org/W4286888643","https://openalex.org/W2614680695","https://openalex.org/W2963392837"],"abstract_inverted_index":{"In":[0,46],"a":[1,6,34,60],"previous":[2],"paper":[3],"we":[4,50],"found":[5],"relation":[7],"between":[8],"the":[9,24,38,47],"ranks":[10],"of":[11,26,41],"co-diagonal":[12,56],"matrices":[13],"(matrices":[14],"with":[15],"zeroes":[16],"in":[17],"their":[18],"diagonal":[19],"and":[20,23,44],"nonzeroes":[21],"elsewhere)":[22],"quality":[25],"explicit":[27],"Ramsey":[28],"graph":[29],"constructions.":[30],"We":[31],"also":[32],"gave":[33],"construction":[35,53],"based":[36,58],"on":[37,59],"BBR":[39],"polynomial":[40],"Barrington,":[42],"Beigel":[43],"Rudich.":[45],"present":[48],"work":[49],"give":[51],"another":[52],"for":[54],"low-rank":[55],"matrices,":[57],"modular":[61],"sieve":[62],"formula.":[63]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}