{"id":"https://openalex.org/W65332180","doi":null,"title":"Bounding the Number of Graphs Containing Very Long Induced Paths","display_name":"Bounding the Number of Graphs Containing Very Long Induced Paths","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W65332180","mag":"65332180"},"language":"en","primary_location":{"id":"pmh:oai:scholarsarchive.byu.edu:etd-1030","doi":null,"is_oa":true,"landing_page_url":"https://scholarsarchive.byu.edu/etd/31","pdf_url":"https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1030&context=etd","source":{"id":"https://openalex.org/S4377196308","display_name":"ScholarsArchive  (Brigham Young University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I100005738","host_organization_name":"Brigham Young University","host_organization_lineage":["https://openalex.org/I100005738"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theses and Dissertations","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1030&context=etd","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016572035","display_name":"Steven K. Butler","orcid":"https://orcid.org/0000-0003-1017-8673","observed_orcids":["https://orcid.org/0000-0003-1017-8673"]},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Steven K. Butler","raw_affiliation_strings":["Brigham Young Univ"],"raw_orcid":"https://orcid.org/0000-0003-1017-8673","affiliations":[{"raw_affiliation_string":"Brigham Young Univ","institution_ids":["https://openalex.org/I100005738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016572035"],"corresponding_institution_ids":["https://openalex.org/I100005738"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01116373,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.5849999785423279,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.5849999785423279,"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.2110999971628189,"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.1868000030517578,"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/induced-paths","display_name":"induced paths","score":0.8759999871253967},{"id":"https://openalex.org/keywords/induced-subgraphs","display_name":"induced subgraphs","score":0.7720000147819519},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"upper and lower bounds","score":0.7409999966621399},{"id":"https://openalex.org/keywords/labeled-graphs","display_name":"labeled graphs","score":0.8650000095367432},{"id":"https://openalex.org/keywords/asymptotic-enumeration","display_name":"asymptotic enumeration","score":0.8420000076293945},{"id":"https://openalex.org/keywords/extremal-graph-theory","display_name":"extremal graph theory","score":0.8209999799728394}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.863001823425293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6728842258453369},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6676256656646729},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.6199771761894226},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5239377617835999},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5222204923629761},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.48800697922706604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48780396580696106},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.48575499653816223},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4315032362937927},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4192148447036743},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4176861643791199},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3991113603115082},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2692963480949402},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1573145091533661},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.10439079999923706},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:scholarsarchive.byu.edu:etd-1030","doi":null,"is_oa":true,"landing_page_url":"https://scholarsarchive.byu.edu/etd/31","pdf_url":"https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1030&context=etd","source":{"id":"https://openalex.org/S4377196308","display_name":"ScholarsArchive  (Brigham Young University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I100005738","host_organization_name":"Brigham Young University","host_organization_lineage":["https://openalex.org/I100005738"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theses and Dissertations","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.92.3664","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.3664","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.ucsd.edu/~sbutler/PDF/thesis.pdf","raw_type":"text"},{"id":"mag:65332180","doi":null,"is_oa":false,"landing_page_url":"https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1030&context=etd","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:scholarsarchive.byu.edu:etd-1030","doi":null,"is_oa":true,"landing_page_url":"https://scholarsarchive.byu.edu/etd/31","pdf_url":"https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1030&context=etd","source":{"id":"https://openalex.org/S4377196308","display_name":"ScholarsArchive  (Brigham Young University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I100005738","host_organization_name":"Brigham Young University","host_organization_lineage":["https://openalex.org/I100005738"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theses and Dissertations","raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W65332180.pdf","grobid_xml":"https://content.openalex.org/works/W65332180.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W1550397373","https://openalex.org/W2004308928","https://openalex.org/W2078467531","https://openalex.org/W2149120814","https://openalex.org/W2797443475","https://openalex.org/W3157991620"],"related_works":["https://openalex.org/W1608748325","https://openalex.org/W2071594117","https://openalex.org/W4405634776","https://openalex.org/W4404346911","https://openalex.org/W4287117723","https://openalex.org/W2039056887","https://openalex.org/W4236126042","https://openalex.org/W4405030128","https://openalex.org/W7154480053","https://openalex.org/W6948187294"],"abstract_inverted_index":{"Induced":[0],"graphs":[1,34,68,87],"are":[2,21],"used":[3],"to":[4,31,61],"describe":[5],"the":[6,51,84],"structure":[7],"of":[8,14,37,53,86,120],"a":[9,29,44,70,94],"graph,":[10],"one":[11],"such":[12,33],"type":[13],"induced":[15,75,101],"graph":[16],"that":[17,115,122],"has":[18],"been":[19],"studied":[20],"long":[22,71],"paths.":[23],"In":[24,77],"this":[25,48],"thesis":[26],"we":[27,56,80,112],"show":[28,114],"way":[30],"represent":[32],"in":[35],"terms":[36],"an":[38,74,100],"array":[39],"with":[40],"two":[41],"colors":[42],"and":[43,50,64,107],"labeled":[45],"graph.":[46],"Using":[47],"representation":[49],"techniques":[52],"Polya":[54],"counting":[55],"will":[57,113],"then":[58,103],"be":[59,83],"able":[60],"get":[62],"upper":[63,106],"lower":[65,108],"bounds":[66,109],"for":[67,110,116],"containing":[69],"path":[72,95],"as":[73,99],"subgraph.":[76],"particular,":[78],"if":[79],"let":[81],"P(n,k)":[82,111],"number":[85],"on":[88,96],"n+k":[89],"vertices":[90],"which":[91],"contains":[92],"P_n,":[93],"n":[97],"vertices,":[98],"subgraph":[102],"using":[104],"our":[105],"any":[117],"fixed":[118],"value":[119],"k":[121],"P(n,k)~2^(nk+k_C_2)/(2k!).":[123]},"counts_by_year":[],"updated_date":"2026-08-30T07:30:35.949966","created_date":"2016-06-24T00:00:00"}