{"id":"https://openalex.org/W2107031161","doi":"https://doi.org/10.1017/s0963548300001486","title":"Some Small Circuit-Cocircuit Ramsey Numbers for Matroids","display_name":"Some Small Circuit-Cocircuit Ramsey Numbers for Matroids","publication_year":1995,"publication_date":"1995-03-01","ids":{"openalex":"https://openalex.org/W2107031161","doi":"https://doi.org/10.1017/s0963548300001486","mag":"2107031161"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548300001486","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548300001486","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/A5077228776","display_name":"Fair Barbour Hurst","orcid":null},"institutions":[{"id":"https://openalex.org/I368840534","display_name":"University of Mississippi","ror":"https://ror.org/02teq1165","country_code":"US","type":"education","lineage":["https://openalex.org/I368840534","https://openalex.org/I4210141039"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fair Barbour Hurst","raw_affiliation_strings":["Department of Mathematics, The University of Mississippi, University, MS 38677, U.S.A","The University of Mississippi"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, The University of Mississippi, University, MS 38677, U.S.A","institution_ids":["https://openalex.org/I368840534"]},{"raw_affiliation_string":"The University of Mississippi","institution_ids":["https://openalex.org/I368840534"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087069531","display_name":"Talmage James Reid","orcid":null},"institutions":[{"id":"https://openalex.org/I368840534","display_name":"University of Mississippi","ror":"https://ror.org/02teq1165","country_code":"US","type":"education","lineage":["https://openalex.org/I368840534","https://openalex.org/I4210141039"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Talmage James Reid","raw_affiliation_strings":["Department of Mathematics, The University of Mississippi, University, MS 38677, U.S.A","The University of Mississippi"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, The University of Mississippi, University, MS 38677, U.S.A","institution_ids":["https://openalex.org/I368840534"]},{"raw_affiliation_string":"The University of Mississippi","institution_ids":["https://openalex.org/I368840534"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I368840534"],"apc_list":null,"apc_paid":null,"fwci":1.0544,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.77973697,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"1","first_page":"67","last_page":"80"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9854816198348999},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8036782145500183},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.7483948469161987},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6717677116394043},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.5808067321777344},{"id":"https://openalex.org/keywords/ramseys-theorem","display_name":"Ramsey's theorem","score":0.5109773874282837},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4990823268890381},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.46970030665397644},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.46862274408340454},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14348351955413818},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10516357421875},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06220090389251709}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9854816198348999},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8036782145500183},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.7483948469161987},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6717677116394043},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.5808067321777344},{"id":"https://openalex.org/C44115641","wikidata":"https://www.wikidata.org/wiki/Q918099","display_name":"Ramsey's theorem","level":3,"score":0.5109773874282837},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4990823268890381},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.46970030665397644},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.46862274408340454},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14348351955413818},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10516357421875},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06220090389251709},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548300001486","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548300001486","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1487872891","https://openalex.org/W1986126741","https://openalex.org/W2013746166","https://openalex.org/W2031658326","https://openalex.org/W2040101882","https://openalex.org/W2048616864","https://openalex.org/W2069367490","https://openalex.org/W2079919815","https://openalex.org/W2137468109","https://openalex.org/W2312770308","https://openalex.org/W2335172256","https://openalex.org/W2796976177"],"related_works":["https://openalex.org/W2058489697","https://openalex.org/W2072414647","https://openalex.org/W4367050287","https://openalex.org/W2400862597","https://openalex.org/W2106412416","https://openalex.org/W2625145881","https://openalex.org/W2046319394","https://openalex.org/W1984819493","https://openalex.org/W2106233458","https://openalex.org/W2159059797"],"abstract_inverted_index":{"Ramsey":[0,8],"numbers":[1,9,69],"for":[2,10],"matroids,":[3],"which":[4],"mimic":[5],"properties":[6],"of":[7,67,73],"graphs,":[11],"have":[12],"been":[13],"denned":[14],"as":[15],"follows.":[16],"Let":[17],"k":[18,51,76],"and":[19,77,88,95],"l":[20,28,59,78],"be":[21],"positive":[22,33],"integers.":[23],"Then":[24],"n":[25,35,42],"(":[26],"k,":[27],")":[29],"is":[30],"the":[31,63,71],"least":[32,50,58],"integer":[34],"such":[36],"that":[37],"every":[38],"connected":[39],"matroid":[40,92,97],"with":[41,48,56,85],"elements":[43,52],"contains":[44],"either":[45],"a":[46,54],"circuit":[47],"at":[49,57],"or":[53],"cocircuit":[55],"elements.":[60],"We":[61,80],"determine":[62],"largest":[64],"known":[65],"value":[66],"these":[68],"in":[70],"sense":[72],"maximizing":[74],"both":[75],".":[79],"also":[81],"find":[82],"extremal":[83,96],"matroids":[84],"small":[86],"circuits":[87],"cocircuits.":[89],"Results":[90],"on":[91],"connectivity,":[93],"geometry,":[94],"theory":[98],"are":[99],"used":[100],"here.":[101]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}