{"id":"https://openalex.org/W2101724873","doi":"https://doi.org/10.1007/bf01206357","title":"An ?(n 4/3) lower bound on the randomized complexity of graph properties","display_name":"An ?(n 4/3) lower bound on the randomized complexity of graph properties","publication_year":1991,"publication_date":"1991-06-01","ids":{"openalex":"https://openalex.org/W2101724873","doi":"https://doi.org/10.1007/bf01206357","mag":"2101724873"},"language":"en","primary_location":{"id":"doi:10.1007/bf01206357","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01206357","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/A5084704741","display_name":"Peter I. Hajnal","orcid":"https://orcid.org/0000-0001-8487-233X"},"institutions":[{"id":"https://openalex.org/I227486990","display_name":"University of Szeged","ror":"https://ror.org/01pnej532","country_code":"HU","type":"education","lineage":["https://openalex.org/I227486990"]},{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["HU","US"],"is_corresponding":true,"raw_author_name":"P\ufffdter Hajnal","raw_affiliation_strings":["Bolyai Institute, University of Szeged, Hungary","Department of Computer Science, Princeton University, Princeton, USA"],"affiliations":[{"raw_affiliation_string":"Bolyai Institute, University of Szeged, Hungary","institution_ids":["https://openalex.org/I227486990"]},{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084704741"],"corresponding_institution_ids":["https://openalex.org/I20089843","https://openalex.org/I227486990"],"apc_list":null,"apc_paid":null,"fwci":0.8212,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.69780854,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"11","issue":"2","first_page":"131","last_page":"143"},"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.9987999796867371,"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.9987999796867371,"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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"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/mathematics","display_name":"Mathematics","score":0.8782124519348145},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7669706344604492},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.704188346862793},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6817731261253357},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6776490211486816},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5646539330482483},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.529315173625946},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5054135322570801},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47016093134880066}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8782124519348145},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7669706344604492},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.704188346862793},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6817731261253357},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6776490211486816},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5646539330482483},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.529315173625946},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5054135322570801},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47016093134880066},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01206357","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01206357","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1510730180","https://openalex.org/W1569752386","https://openalex.org/W1966167835","https://openalex.org/W1977600272","https://openalex.org/W2023146810","https://openalex.org/W2039027438","https://openalex.org/W2041763757","https://openalex.org/W2042587503","https://openalex.org/W2061496873","https://openalex.org/W2071773666","https://openalex.org/W2082497622","https://openalex.org/W2147862220"],"related_works":["https://openalex.org/W2091826982","https://openalex.org/W2036057584","https://openalex.org/W245205139","https://openalex.org/W2921162226","https://openalex.org/W4234658180","https://openalex.org/W2107875203","https://openalex.org/W4235849992","https://openalex.org/W4246000090","https://openalex.org/W3143578817","https://openalex.org/W2910933086"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}