{"id":"https://openalex.org/W2158150582","doi":"https://doi.org/10.1017/s096354830400639x","title":"Families of Trees Decompose the Random Graph in an Arbitrary Way","display_name":"Families of Trees Decompose the Random Graph in an Arbitrary Way","publication_year":2004,"publication_date":"2004-11-01","ids":{"openalex":"https://openalex.org/W2158150582","doi":"https://doi.org/10.1017/s096354830400639x","mag":"2158150582"},"language":"en","primary_location":{"id":"doi:10.1017/s096354830400639x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s096354830400639x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/802BF7C5C044B7BCC44A0BE065A67238/S096354830400639Xa.pdf/div-class-title-families-of-trees-decompose-the-random-graph-in-an-arbitrary-way-div.pdf","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":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/802BF7C5C044B7BCC44A0BE065A67238/S096354830400639Xa.pdf/div-class-title-families-of-trees-decompose-the-random-graph-in-an-arbitrary-way-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026016357","display_name":"Raphael Yuster","orcid":"https://orcid.org/0000-0001-7550-6506"},"institutions":[{"id":"https://openalex.org/I107326029","display_name":"Oranim Academic College of Education","ror":"https://ror.org/01539v588","country_code":"IL","type":"education","lineage":["https://openalex.org/I107326029"]},{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"RAPHAEL YUSTER","raw_affiliation_strings":["Department of Mathematics, University of Haifa at Oranim, Tivon 36006, Israel (e-mail:","Department of Mathematics, University of Haifa at Oranim, Tivon 36006, Israel (e-mail: raphy@research.haifa.ac.il World Wide Web: http:\\research.haifa.ac.il\\~raphy)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Haifa at Oranim, Tivon 36006, Israel (e-mail:","institution_ids":["https://openalex.org/I107326029"]},{"raw_affiliation_string":"Department of Mathematics, University of Haifa at Oranim, Tivon 36006, Israel (e-mail: raphy@research.haifa.ac.il World Wide Web: http:\\research.haifa.ac.il\\~raphy)#TAB#","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026016357"],"corresponding_institution_ids":["https://openalex.org/I107326029","https://openalex.org/I91203450"],"apc_list":null,"apc_paid":null,"fwci":0.4952,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65372508,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"6","first_page":"893","last_page":"910"},"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.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"}},"topics":[{"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.9955999851226807,"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/T10849","display_name":"Finite Group Theory Research","score":0.965499997138977,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8921248316764832},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7352980375289917},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6275812983512878},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5974922776222229},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4656409025192261},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4402981698513031},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41517066955566406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.0628092885017395}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8921248316764832},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7352980375289917},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6275812983512878},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5974922776222229},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4656409025192261},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4402981698513031},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41517066955566406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0628092885017395},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s096354830400639x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s096354830400639x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/802BF7C5C044B7BCC44A0BE065A67238/S096354830400639Xa.pdf/div-class-title-families-of-trees-decompose-the-random-graph-in-an-arbitrary-way-div.pdf","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.240.9070","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.240.9070","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/math/0210339v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.375.6980","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.375.6980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.haifa.ac.il/~raphy/papers/threshpk.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1017/s096354830400639x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s096354830400639x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/802BF7C5C044B7BCC44A0BE065A67238/S096354830400639Xa.pdf/div-class-title-families-of-trees-decompose-the-random-graph-in-an-arbitrary-way-div.pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2158150582.pdf","grobid_xml":"https://content.openalex.org/works/W2158150582.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1504418244","https://openalex.org/W1510730180","https://openalex.org/W1529556207","https://openalex.org/W1636454816","https://openalex.org/W1965142549","https://openalex.org/W1994941667","https://openalex.org/W2026218370","https://openalex.org/W2068871408","https://openalex.org/W2905110430","https://openalex.org/W2912057363","https://openalex.org/W3213692093"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4256429076","https://openalex.org/W2012063272","https://openalex.org/W2348092930","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W2072510267","https://openalex.org/W1553466895","https://openalex.org/W2963287622"],"abstract_inverted_index":{"Let":[0],"$F\\,{=}\\,\\{H_1,\\ldots,H_k\\}$":[1],"be":[2],"a":[3,34,39,57,81,102,113],"family":[4,74],"of":[5,21,41,44,59,75,128],"graphs.":[6],"A":[7],"graph":[8,91],"$G$":[9,45],"is":[10,33,38,70,80,93,101,112],"called":[11],"totally":[12,94],"$F$":[13,69,95],"-":[14],"decomposable":[15],"if":[16,68,99],"for":[17,62,85,117],"every":[18],"linear":[19],"combination":[20],"the":[22,42,86,89,118],"form":[23],"$\\alpha_1":[24],"e(H_1)":[25],"\\,{+}\\,{\\cdots}\\,{+}\\,\\alpha_k":[26],"e(H_k)":[27],"\\,{=}\\,":[28],"e(G)$":[29],"where":[30],"each":[31,56],"$\\alpha_i$":[32,52],"nonnegative":[35],"integer,":[36],"there":[37],"colouring":[40],"edges":[43],"with":[46,104],"$\\alpha_1\\,{+}\\,{\\cdots}\\,{+}\\,\\alpha_k$":[47],"colours":[48],"such":[49],"that":[50,67,88,120],"exactly":[51],"colour":[53],"classes":[54],"induce":[55],"copy":[58],"$H_i$":[60],",":[61],"$i\\,{=}\\,1,\\ldots,k$":[63],".":[64,130],"We":[65],"prove":[66],"any":[71],"fixed":[72],"nontrivial":[73],"trees":[76],"then":[77,109],"$\\log":[78,110],"n/n$":[79,111],"sharp":[82,114],"threshold":[83,115],"function":[84,116],"property":[87,119],"random":[90],"$G(n,p)$":[92,121],"-decomposable.":[96],"In":[97],"particular,":[98],"$H$":[100,129],"tree":[103],"more":[105],"than":[106],"one":[107],"edge,":[108],"contains":[122],"$\\lfloor":[123],"e(G)/e(H)":[124],"\\rfloor$":[125],"edge-disjoint":[126],"copies":[127]},"counts_by_year":[],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}