{"id":"https://openalex.org/W1554772464","doi":"https://doi.org/10.37236/714","title":"A Ramsey Theorem for Indecomposable Matchings","display_name":"A Ramsey Theorem for Indecomposable Matchings","publication_year":2011,"publication_date":"2011-12-05","ids":{"openalex":"https://openalex.org/W1554772464","doi":"https://doi.org/10.37236/714","mag":"1554772464"},"language":"en","primary_location":{"id":"doi:10.37236/714","is_oa":true,"landing_page_url":"https://doi.org/10.37236/714","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p227/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p227/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064964159","display_name":"James Fairbanks","orcid":"https://orcid.org/0000-0002-1778-3350"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"James P. Fairbanks","raw_affiliation_strings":["Department of Mathematics University of Florida Gainesville, Florida, USA","[University of Florida]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics University of Florida Gainesville, Florida, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"[University of Florida]","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5064964159"],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04828523,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9970999956130981,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9614999890327454,"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/indecomposable-module","display_name":"Indecomposable module","score":0.9896860122680664},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7862398624420166},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.764631986618042},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.706537127494812},{"id":"https://openalex.org/keywords/ramseys-theorem","display_name":"Ramsey's theorem","score":0.639738917350769},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.362221360206604}],"concepts":[{"id":"https://openalex.org/C157480366","wikidata":"https://www.wikidata.org/wiki/Q2499534","display_name":"Indecomposable module","level":2,"score":0.9896860122680664},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7862398624420166},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.764631986618042},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.706537127494812},{"id":"https://openalex.org/C44115641","wikidata":"https://www.wikidata.org/wiki/Q918099","display_name":"Ramsey's theorem","level":3,"score":0.639738917350769},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.362221360206604},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/714","is_oa":true,"landing_page_url":"https://doi.org/10.37236/714","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p227/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/714","is_oa":true,"landing_page_url":"https://doi.org/10.37236/714","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p227/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1554772464.pdf","grobid_xml":"https://content.openalex.org/works/W1554772464.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W1987867438","https://openalex.org/W2061432895"],"related_works":["https://openalex.org/W2046202915","https://openalex.org/W2101126588","https://openalex.org/W2134378549","https://openalex.org/W1561903201","https://openalex.org/W1605507094","https://openalex.org/W2043020651","https://openalex.org/W2990545556","https://openalex.org/W2018966352","https://openalex.org/W1970497402","https://openalex.org/W2054126834"],"abstract_inverted_index":{"A":[0],"matching":[1,37,42],"is":[2],"indecomposable":[3,29,36,41],"if":[4],"it":[5],"does":[6],"not":[7],"contain":[8],"a":[9,25,39],"nontrivial":[10],"contiguous":[11],"segment":[12],"of":[13,43,45],"vertices":[14],"whose":[15],"neighbors":[16],"are":[17],"entirely":[18],"contained":[19],"in":[20],"the":[21],"segment.":[22],"We":[23],"prove":[24],"Ramsey-like":[26],"result":[27],"for":[28],"matchings,":[30],"showing":[31],"that":[32],"every":[33],"sufficiently":[34],"long":[35,40],"contains":[38],"one":[44],"three":[46],"types:":[47],"interleavings,":[48],"broken":[49],"nestings,":[50],"and":[51],"proper":[52],"pin":[53],"sequences.":[54]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}