{"id":"https://openalex.org/W2043904987","doi":"https://doi.org/10.1007/s00153-010-0212-9","title":"A note on propositional proof complexity of some Ramsey-type statements","display_name":"A note on propositional proof complexity of some Ramsey-type statements","publication_year":2010,"publication_date":"2010-10-12","ids":{"openalex":"https://openalex.org/W2043904987","doi":"https://doi.org/10.1007/s00153-010-0212-9","mag":"2043904987"},"language":"en","primary_location":{"id":"doi:10.1007/s00153-010-0212-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00153-010-0212-9","pdf_url":null,"source":{"id":"https://openalex.org/S188076996","display_name":"Archive for Mathematical Logic","issn_l":"0933-5846","issn":["0933-5846","1432-0665"],"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":"Archive for Mathematical Logic","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/A5069803587","display_name":"Jan Kraj\u0131\u0301\u010dek","orcid":"https://orcid.org/0000-0003-0670-3957"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan Kraj\u00ed\u010dek","raw_affiliation_strings":["Faculty of Mathematics and Physics, Charles University, Sokolovsk\u00e1 83, Prague 8, 186 75, The Czech Republic","Faculty of Mathematics and Physics, Charles University, Prague 8, The Czech Republic 186 75#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University, Sokolovsk\u00e1 83, Prague 8, 186 75, The Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University, Prague 8, The Czech Republic 186 75#TAB#","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069803587"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":1.2759,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.7971028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"50","issue":"1-2","first_page":"245","last_page":"255"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9995999932289124,"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.9988999962806702,"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.8321105241775513},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6748036742210388},{"id":"https://openalex.org/keywords/statement","display_name":"Statement (logic)","score":0.6041104197502136},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5929186344146729},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5785960555076599},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5484389662742615},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.5433758497238159},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5003924369812012},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4914942979812622},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4336357116699219},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42126303911209106},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.0738278329372406}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8321105241775513},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6748036742210388},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.6041104197502136},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5929186344146729},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5785960555076599},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5484389662742615},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.5433758497238159},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5003924369812012},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4914942979812622},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4336357116699219},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42126303911209106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0738278329372406},{"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00153-010-0212-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00153-010-0212-9","pdf_url":null,"source":{"id":"https://openalex.org/S188076996","display_name":"Archive for Mathematical Logic","issn_l":"0933-5846","issn":["0933-5846","1432-0665"],"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":"Archive for Mathematical Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.576.6769","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.576.6769","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.karlin.mff.cuni.cz/~krajicek/ram.pdf","raw_type":"text"},{"id":"pmh:oai:asep.lib.cas.cz:CavUnEpca/0369652","is_oa":false,"landing_page_url":"http://hdl.handle.net/11104/0203666","pdf_url":null,"source":{"id":"https://openalex.org/S7407055266","display_name":"ASEP","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W141966453","https://openalex.org/W1511859173","https://openalex.org/W1552145226","https://openalex.org/W1597834884","https://openalex.org/W1607926272","https://openalex.org/W2015463688","https://openalex.org/W2026967932","https://openalex.org/W2029390834","https://openalex.org/W2036503832","https://openalex.org/W2037028865","https://openalex.org/W2045472305","https://openalex.org/W2080353886","https://openalex.org/W2095226356","https://openalex.org/W2114817374","https://openalex.org/W2162177577","https://openalex.org/W2167115661","https://openalex.org/W2167477884","https://openalex.org/W2169713712","https://openalex.org/W2969873114","https://openalex.org/W4213091458","https://openalex.org/W4248733413"],"related_works":["https://openalex.org/W2099785256","https://openalex.org/W187835144","https://openalex.org/W315696179","https://openalex.org/W4288055874","https://openalex.org/W2186044446","https://openalex.org/W2945126541","https://openalex.org/W3196023996","https://openalex.org/W1533619009","https://openalex.org/W47204537","https://openalex.org/W2611984052"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":27},{"year":2016,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}