{"id":"https://openalex.org/W1604333196","doi":"https://doi.org/10.37236/1496","title":"Constrained graph processes","display_name":"Constrained graph processes","publication_year":2000,"publication_date":"2000-02-23","ids":{"openalex":"https://openalex.org/W1604333196","doi":"https://doi.org/10.37236/1496","mag":"1604333196"},"language":"en","primary_location":{"id":"doi:10.37236/1496","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1496","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v7i1r18/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":false,"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":"bronze","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v7i1r18/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109915650","display_name":"B\u00e9la Bollob\u00e1s","orcid":"https://orcid.org/0000-0002-9819-7213"},"institutions":[{"id":"https://openalex.org/I94658018","display_name":"University of Memphis","ror":"https://ror.org/01cq23130","country_code":"US","type":"education","lineage":["https://openalex.org/I94658018"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B\u00e9la Bollob\u00e1s","raw_affiliation_strings":["Department of Mathematical Sciences University of Memphis, Memphis TN 38152","Trinity College, Cambridge CB2 1TQ, England"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences University of Memphis, Memphis TN 38152","institution_ids":["https://openalex.org/I94658018"]},{"raw_affiliation_string":"Trinity College, Cambridge CB2 1TQ, England","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050759286","display_name":"Oliver Riordan","orcid":"https://orcid.org/0000-0002-2934-8065"},"institutions":[{"id":"https://openalex.org/I94658018","display_name":"University of Memphis","ror":"https://ror.org/01cq23130","country_code":"US","type":"education","lineage":["https://openalex.org/I94658018"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Oliver Riordan","raw_affiliation_strings":["Trinity College, Cambridge CB2 1TQ, England","Department of Mathematical Sciences University of Memphis, Memphis TN 38152"],"affiliations":[{"raw_affiliation_string":"Trinity College, Cambridge CB2 1TQ, England","institution_ids":[]},{"raw_affiliation_string":"Department of Mathematical Sciences University of Memphis, Memphis TN 38152","institution_ids":["https://openalex.org/I94658018"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109915650"],"corresponding_institution_ids":["https://openalex.org/I94658018"],"apc_list":null,"apc_paid":null,"fwci":1.9971,"has_fulltext":true,"cited_by_count":53,"citation_normalized_percentile":{"value":0.818125,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"7","issue":"1","first_page":null,"last_page":null},"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.996399998664856,"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.996399998664856,"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.9951000213623047,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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.8534383773803711},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7638816833496094},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6130601167678833},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49644237756729126},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4512662887573242},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.41540688276290894}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8534383773803711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7638816833496094},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6130601167678833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49644237756729126},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4512662887573242},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.41540688276290894},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/1496","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1496","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v7i1r18/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":false,"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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.88.9049","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.9049","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.emis.de/journals/EJC/Volume_7/PDF/v7i1r18.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1496","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1496","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v7i1r18/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":false,"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/W1604333196.pdf","grobid_xml":"https://content.openalex.org/works/W1604333196.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W2042587503","https://openalex.org/W2066780439","https://openalex.org/W2094660504","https://openalex.org/W2134771417","https://openalex.org/W2166965860","https://openalex.org/W2905110430"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2077383796","https://openalex.org/W2953461625","https://openalex.org/W2080136900","https://openalex.org/W4390409907","https://openalex.org/W2586280130","https://openalex.org/W4221143622","https://openalex.org/W1981723335","https://openalex.org/W2089088747","https://openalex.org/W2152772468"],"abstract_inverted_index":{"Let":[0],"$\\mathcal{Q}$":[1],"be":[2,217,248],"a":[3,25,46,112,141,164,180,202,206],"monotone":[4],"decreasing":[5],"property":[6,143,154],"of":[7,23,132,161,191,227],"graphs":[8,105,118,152],"$G$":[9,33,43],"on":[10,37,211],"$n$":[11,38],"vertices.":[12,39],"Erd\u0151s,":[13,76],"Suen":[14,77],"and":[15,78,95,106,221,229],"Winkler":[16,79],"[5]":[17],"introduced":[18],"the":[19,34,68,84,127,153,185,192,209,225],"following":[20],"natural":[21],"way":[22,207],"choosing":[24,50],"random":[26,117],"maximal":[27,73],"graph":[28,36,69,86],"in":[29,74,173,204,252],"$\\mathcal{Q}$:":[30],"start":[31],"with":[32,144,170],"empty":[35],"Add":[40],"edges":[41,83],"to":[42,136,178],"one":[44,199],"at":[45,201],"time,":[47],"each":[48],"time":[49,203],"uniformly":[51],"from":[52],"all":[53],"$e\\in":[54],"G^c$":[55],"such":[56,65,205],"that":[57,138,156,208],"$G+e\\in":[58],"\\mathcal{Q}$.":[59],"Stop":[60],"when":[61],"there":[62],"are":[63],"no":[64],"edges,":[66],"so":[67],"$G_\\infty$":[70],"reached":[71],"is":[72,126,155,189,236],"$\\mathcal{Q}$.":[75],"asked":[80],"how":[81],"many":[82],"resulting":[85],"typically":[87],"has,":[88],"giving":[89],"good":[90],"bounds":[91],"for":[92,103,107,149],"$\\mathcal{Q}=\\{$bipartite":[93],"graphs$\\}$":[94],"$\\mathcal{Q}=\\{$triangle":[96],"free":[97,151],"graphs$\\}$.":[98],"We":[99,134,175],"answer":[100],"this":[101],"question":[102,114],"$C_4$-free":[104],"$K_4$-free":[108],"graphs,":[109],"by":[110,129],"considering":[111],"related":[113],"about":[115],"standard":[116,181],"$G_p\\in":[119],"\\mathcal{G}(n,p)$.":[120],"The":[121,231,240],"main":[122],"technique":[123],"we":[124,196],"use":[125],"'step":[128],"step'":[130],"approach":[131],"[3].":[133,253],"wish":[135],"show":[137],"$G_p$":[139,198],"has":[140,213],"certain":[142],"high":[145],"probability.":[146],"For":[147],"example,":[148],"$K_4$":[150,172],"every":[157],"'large'":[158],"set":[159],"$V$":[160],"vertices":[162],"contains":[163],"triangle":[165],"not":[166,190],"sharing":[167],"an":[168],"edge":[169],"any":[171],"$G_p$.":[174],"would":[176],"like":[177],"apply":[179],"Martingale":[182],"inequality,":[183],"but":[184],"complicated":[186,243],"dependence":[187,210],"involved":[188],"right":[193],"form.":[194],"Instead":[195],"examine":[197],"step":[200],"what":[212],"gone":[214],"before":[215],"can":[216,246],"split":[218],"into":[219],"'positive'":[220],"'negative'":[222],"parts,":[223],"using":[224],"notions":[226],"up-sets":[228],"down-sets.":[230],"relatively":[232],"simple":[233],"positive":[234],"part":[235,245],"then":[237],"estimated":[238],"directly.":[239],"much":[241],"more":[242],"negative":[244],"simply":[247],"ignored,":[249],"as":[250],"shown":[251]},"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":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2025-10-10T00:00:00"}