{"id":"https://openalex.org/W2163621408","doi":"https://doi.org/10.1017/s0963548300000146","title":"On Subgraph Sizes in Random Graphs","display_name":"On Subgraph Sizes in Random Graphs","publication_year":1992,"publication_date":"1992-06-01","ids":{"openalex":"https://openalex.org/W2163621408","doi":"https://doi.org/10.1017/s0963548300000146","mag":"2163621408"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548300000146","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548300000146","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054846995","display_name":"Neil J. Calkin","orcid":"https://orcid.org/0000-0002-5701-8581"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Neil Calkin","raw_affiliation_strings":["Department of Mathematics, Carnegie Mellon University, Pittsburgh, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Carnegie Mellon University, Pittsburgh, U.S.A","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan Frieze","raw_affiliation_strings":["Department of Mathematics, Carnegie Mellon University, Pittsburgh, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Carnegie Mellon University, Pittsburgh, U.S.A","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014961672","display_name":"Brendan D. McKay","orcid":"https://orcid.org/0000-0002-3553-0496"},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Brendan D. McKay","raw_affiliation_strings":["Department of Computer Science, Australian National University, Canberra, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Australian National University, Canberra, Australia","institution_ids":["https://openalex.org/I118347636"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054846995"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.26350382,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"1","issue":"2","first_page":"123","last_page":"134"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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"}}],"keywords":[{"id":"https://openalex.org/keywords/rss","display_name":"RSS","score":0.8685086965560913},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7691780924797058},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5709841847419739},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5703537464141846},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5385549664497375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5248147249221802},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5086406469345093},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4824281632900238},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43927913904190063},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.41422370076179504},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3862164318561554},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2936558723449707},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.13016605377197266},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.10107731819152832},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.0535871684551239}],"concepts":[{"id":"https://openalex.org/C2385561","wikidata":"https://www.wikidata.org/wiki/Q45432","display_name":"RSS","level":2,"score":0.8685086965560913},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7691780924797058},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5709841847419739},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5703537464141846},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5385549664497375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5248147249221802},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5086406469345093},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4824281632900238},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43927913904190063},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.41422370076179504},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3862164318561554},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2936558723449707},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.13016605377197266},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.10107731819152832},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0535871684551239}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548300000146","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548300000146","pdf_url":null,"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.71.498","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.498","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cmu.edu/~af1p/Texfiles/sizes.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2905110430","https://openalex.org/W3037173771"],"related_works":["https://openalex.org/W2789636091","https://openalex.org/W2007346569","https://openalex.org/W3102805201","https://openalex.org/W2367468405","https://openalex.org/W2288163449","https://openalex.org/W3008959778","https://openalex.org/W1979190428","https://openalex.org/W4381707488","https://openalex.org/W4300575715","https://openalex.org/W2789630860"],"abstract_inverted_index":{"For":[0],"a":[1,23,31,49,54,66],"graph":[2,51],"G":[3,15,21,29,36],"with":[4,26],"m":[5,42],"edges":[6],"let":[7],"its":[8],"Range":[9],"of":[10,65],"Subgraph":[11],"Sizes":[12],"(RSS)":[13],"\u03c1(":[14,35],")":[16,37],"=":[17,38],"{":[18],"t":[19,27],":":[20],"contains":[22],"vertex-induced":[24],"subgraph":[25],"edges}.":[28],"has":[30],"full":[32,55],"RSS":[33,56,64],"if":[34],"{0,":[39],"1,":[40],"\u2026,":[41],"}.":[43],"We":[44],"establish":[45],"the":[46,62],"threshold":[47],"for":[48],"random":[50,68],"to":[52],"have":[53],"and":[57],"give":[58],"tight":[59],"bounds":[60],"on":[61],"likely":[63],"dense":[67],"graph.":[69]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}