{"id":"https://openalex.org/W2118626701","doi":"https://doi.org/10.1002/1098-2418(200101)18:1<61::aid-rsa5>3.0.co;2-t","title":"Random maximalH-free graphs","display_name":"Random maximalH-free graphs","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2118626701","doi":"https://doi.org/10.1002/1098-2418(200101)18:1<61::aid-rsa5>3.0.co;2-t","mag":"2118626701"},"language":"en","primary_location":{"id":"doi:10.1002/1098-2418(200101)18:1<61::aid-rsa5>3.0.co;2-t","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1098-2418(200101)18:1<61::aid-rsa5>3.0.co;2-t","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures and Algorithms","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/A5009459540","display_name":"Deryk Osthus","orcid":"https://orcid.org/0000-0002-3059-4298"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Deryk Osthus","raw_affiliation_strings":["Institut fu\u0308r Informatik, Humboldt-Universita\u0308t zu Berlin, Unter den Linden 6, 10099 Berlin, Germany","Institut f\u00fcr Informatik, Humboldt\u2010Universit\u00e4t zu Berlin, Unter den Linden 6, 10099 Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut fu\u0308r Informatik, Humboldt-Universita\u0308t zu Berlin, Unter den Linden 6, 10099 Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt\u2010Universit\u00e4t zu Berlin, Unter den Linden 6, 10099 Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026270025","display_name":"Anusch Taraz","orcid":"https://orcid.org/0000-0003-3646-3683"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Anusch Taraz","raw_affiliation_strings":["Institut fu\u0308r Informatik, Humboldt-Universita\u0308t zu Berlin, Unter den Linden 6, 10099 Berlin, Germany","Institut f\u00fcr Informatik, Humboldt\u2010Universit\u00e4t zu Berlin, Unter den Linden 6, 10099 Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut fu\u0308r Informatik, Humboldt-Universita\u0308t zu Berlin, Unter den Linden 6, 10099 Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt\u2010Universit\u00e4t zu Berlin, Unter den Linden 6, 10099 Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5009459540"],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":{"value":4550,"currency":"USD","value_usd":4550},"apc_paid":null,"fwci":2.572,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.89215686,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"18","issue":"1","first_page":"61","last_page":"82"},"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.9998999834060669,"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.9998999834060669,"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.9983999729156494,"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.9973000288009644,"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/combinatorics","display_name":"Combinatorics","score":0.752886176109314},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5950040817260742},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5761058330535889},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.5557354688644409},{"id":"https://openalex.org/keywords/random-regular-graph","display_name":"Random regular graph","score":0.551544725894928},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.5488584041595459},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.5365889668464661},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5047785043716431},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4915672242641449},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.4732570946216583},{"id":"https://openalex.org/keywords/regular-graph","display_name":"Regular graph","score":0.42924758791923523},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2395574152469635}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.752886176109314},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5950040817260742},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5761058330535889},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.5557354688644409},{"id":"https://openalex.org/C4255713","wikidata":"https://www.wikidata.org/wiki/Q7291988","display_name":"Random regular graph","level":5,"score":0.551544725894928},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.5488584041595459},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.5365889668464661},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5047785043716431},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4915672242641449},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.4732570946216583},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.42924758791923523},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2395574152469635}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/1098-2418(200101)18:1<61::aid-rsa5>3.0.co;2-t","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1098-2418(200101)18:1<61::aid-rsa5>3.0.co;2-t","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures and Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.25.3213","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.3213","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.hu-berlin.de/~osthus/greedy.ps","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/86401257-9117-4377-9fad-6b0e142e2634","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/86401257-9117-4377-9fad-6b0e142e2634","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Osthus, D & Taraz, A 2001, 'Random maximal H-free graphs', Random Structures and Algorithms, vol. 18, pp. 61-82. https://doi.org/10.1002/1098-2418(200101)18:1<61::AID-RSA5>3.0.CO;2-T","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1604333196","https://openalex.org/W2009489698","https://openalex.org/W2054812794","https://openalex.org/W2100437838","https://openalex.org/W2131309366","https://openalex.org/W2134771417","https://openalex.org/W2136227650","https://openalex.org/W2155360885","https://openalex.org/W2166264168","https://openalex.org/W2476848496","https://openalex.org/W2478722229","https://openalex.org/W2911322315","https://openalex.org/W4232923409"],"related_works":["https://openalex.org/W2954009223","https://openalex.org/W1972907198","https://openalex.org/W3110704126","https://openalex.org/W1999761254","https://openalex.org/W2483136700","https://openalex.org/W4290651641","https://openalex.org/W3170778148","https://openalex.org/W2028349899","https://openalex.org/W2048112267","https://openalex.org/W2004538016"],"abstract_inverted_index":{"Given":[0],"a":[1,4,29,52,68,80,101,112,116],"graph":[2,8,25,45,62,81,114],"H,":[3],"random":[5,14],"maximal":[6],"H-free":[7],"is":[9,32,55,58,74,100,111],"constructed":[10],"by":[11],"the":[12,23,43,61,94,107,121],"following":[13],"greedy":[15],"process.":[16],"First":[17],"assign":[18],"to":[19],"each":[20],"edge":[21,54],"of":[22,70,96,123],"complete":[24,113],"on":[26,93,136],"n":[27],"vertices":[28],"birthtime":[30],"which":[31,105,134],"uniformly":[33],"distributed":[34],"in":[35,60],"[0,":[36],"1].":[37],"At":[38],"time":[39,51],"p=0":[40],"start":[41],"with":[42,125],"empty":[44],"and":[46,130],"increase":[47],"p":[48],"gradually.":[49],"Each":[50],"new":[53],"born,":[56],"it":[57],"included":[59],"if":[63,98],"this":[64],"does":[65],"not":[66],"create":[67],"copy":[69],"H.":[71],"The":[72],"question":[73],"then":[75],"how":[76],"many":[77],"edges":[78,97],"such":[79],"will":[82],"have":[83],"when":[84,109],"p=1.":[85],"Here":[86],"we":[87,119],"give":[88],"asymptotically":[89],"almost":[90],"sure":[91],"bounds":[92,138],"number":[95,132],"H":[99,110],"strictly":[102],"2-balanced":[103],"graph,":[104],"includes":[106],"case":[108],"or":[115],"cycle.":[117],"Furthermore,":[118],"prove":[120],"existence":[122],"graphs":[124],"girth":[126],"greater":[127],"than":[128],"\ud835\udcc1":[129],"chromatic":[131],"n*y1/(\ud835\udcc1-1)+o(1),":[133],"improves":[135],"previous":[137],"for":[139],"\ud835\udcc1>3.":[140],"\u00a92001":[141],"John":[142],"Wiley":[143],"&":[144],"Sons,":[145],"Inc.":[146],"Random":[147],"Struct.":[148],"Alg.,":[149],"18:":[150],"61\u201382,":[151],"2001":[152]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}