{"id":"https://openalex.org/W2015572657","doi":"https://doi.org/10.1080/00207169508804386","title":"On the expected number of edges in a maximum matching of an (r,s)-tree","display_name":"On the expected number of edges in a maximum matching of an (r,s)-tree","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2015572657","doi":"https://doi.org/10.1080/00207169508804386","mag":"2015572657"},"language":"en","primary_location":{"id":"doi:10.1080/00207169508804386","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169508804386","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5009343313","display_name":"J. H. Cho","orcid":null},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. H. Cho","raw_affiliation_strings":["\n                   \n               Department of Mathematics, Michigan State University, East Lansing, MI, 48824","Department of Mathematics , Michigan State University , East Lansing, MI, 48824"],"affiliations":[{"raw_affiliation_string":"\n                   \n               Department of Mathematics, Michigan State University, East Lansing, MI, 48824","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Department of Mathematics , Michigan State University , East Lansing, MI, 48824","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111708984","display_name":"Edgar M. Palmer","orcid":null},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. M. Palmer","raw_affiliation_strings":["\n                   \n               Department of Mathematics, Michigan State University, East Lansing, MI, 48824","Department of Mathematics , Michigan State University , East Lansing, MI, 48824"],"affiliations":[{"raw_affiliation_string":"\n                   \n               Department of Mathematics, Michigan State University, East Lansing, MI, 48824","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Department of Mathematics , Michigan State University , East Lansing, MI, 48824","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009343313"],"corresponding_institution_ids":["https://openalex.org/I87216513"],"apc_list":null,"apc_paid":null,"fwci":1.4759,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75186567,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"56","issue":"1-2","first_page":"39","last_page":"50"},"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.9994999766349792,"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.9994999766349792,"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.9991999864578247,"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/T11476","display_name":"Graph theory and applications","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8458396196365356},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6128707528114319},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5767191648483276},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5282729268074036},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35394051671028137},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.17224863171577454}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8458396196365356},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6128707528114319},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5767191648483276},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5282729268074036},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35394051671028137},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.17224863171577454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169508804386","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169508804386","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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":8,"referenced_works":["https://openalex.org/W599250420","https://openalex.org/W1987280162","https://openalex.org/W2014666265","https://openalex.org/W2045390532","https://openalex.org/W2056963826","https://openalex.org/W2072873324","https://openalex.org/W2108430962","https://openalex.org/W6618147227"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2042127053","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"(r,":[2,35,43,67],"s)-tree":[3],"is":[4,104],"a":[5,54,101,109,120],"connected,":[6],"acyclic,":[7],"bipartite":[8],"graph":[9],"with":[10,113],"r":[11,83],"light":[12],"and":[13,69,84],"s":[14],"dark":[15,98],"vertices.":[16],"In":[17],"an":[18],"earlier":[19],"paper":[20],"[Pa92]":[21],"we":[22,38],"investigated":[23],"the":[24,29,58,62,73,94,114,118],"edge":[25,74],"independence":[26,64,75],"number":[27,65],"of":[28,31,61,66,72,97,117],"superposition":[30],"2":[32],"or":[33],"more":[34],"s)-trees.":[36],"Here":[37],"focus":[39],"on":[40],"just":[41],"one":[42],"s)-tree.":[44],"We":[45],"use":[46],"three":[47],"variable":[48],"exponential":[49],"generating":[50,130],"functions":[51,131],"to":[52,122],"establish":[53],"recurrence":[55],"relation":[56],"for":[57,81,90,111],"expected":[59],"value":[60],"vertex":[63],"s)-trees,":[68],"hence":[70],"that":[71,89],"number.":[76],"Numerical":[77],"values":[78],"are":[79],"calculated":[80],"small":[82,91],"s.":[85],"The":[86],"data":[87],"shows":[88],"(n,":[92],"n)-trees":[93],"average":[95],"percentage":[96],"vertices":[99],"in":[100,125],"maximum":[102],"matching":[103],"over":[105],"87%.":[106],"This":[107],"provides":[108],"basis":[110],"comparison":[112],"asymptotic":[115],"behavior":[116],"expectation,":[119],"topic":[121],"be":[123],"explored":[124],"another":[126],"paper.":[127],"Keywords:":[128],"Treesmatchingsindependenceexponential":[129]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}