{"id":"https://openalex.org/W2519976468","doi":null,"title":"Spanning subgraphs of dense graphs and a combinatorial problem on strings","display_name":"Spanning subgraphs of dense graphs and a combinatorial problem on strings","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2519976468","mag":"2519976468"},"language":"en","primary_location":{"id":"mag:2519976468","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=928649","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},"volume":null,"type":"article","indexed_in":[],"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/A5011335118","display_name":"Sarmad Abbasi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sarmad Abbasi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110644008","display_name":"Endre Szemer\u00e9di","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Endre Szemer\u00e9di","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.366171,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":1.0,"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":1.0,"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":9.999999747378752e-05,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.0,"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/spanning-subgraphs","display_name":"spanning subgraphs","score":0.968999981880188},{"id":"https://openalex.org/keywords/dense-graphs","display_name":"dense graphs","score":0.9639999866485596},{"id":"https://openalex.org/keywords/bipartite-graphs","display_name":"bipartite graphs","score":0.7699999809265137},{"id":"https://openalex.org/keywords/network-embedding","display_name":"graph embedding","score":0.6610000133514404},{"id":"https://openalex.org/keywords/bandwidth","display_name":"bandwidth","score":0.7900000214576721},{"id":"https://openalex.org/keywords/decomposition-theorem","display_name":"decomposition theorem","score":0.5789999961853027},{"id":"https://openalex.org/keywords/molecular-biology-applications","display_name":"molecular biology applications","score":0.47099998593330383},{"id":"https://openalex.org/keywords/extremal-graph-theory","display_name":"extremal graph theory","score":0.6439999938011169},{"id":"https://openalex.org/keywords/minimum-degree","display_name":"minimum degree","score":0.4440000057220459}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8876082897186279},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.734222412109375},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7028189897537231},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5328781008720398},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.47645023465156555},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4639289975166321},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4295181632041931},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4025992453098297}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2519976468","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=928649","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":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1997392794","https://openalex.org/W2077900128","https://openalex.org/W88735296","https://openalex.org/W2083035128","https://openalex.org/W2014134141","https://openalex.org/W3047736718","https://openalex.org/W4400481796","https://openalex.org/W2403459774","https://openalex.org/W2560158000","https://openalex.org/W2787260064"],"abstract_inverted_index":{"This":[0,102,293,317],"thesis":[1,10,309],"consists":[2],"of":[3,8,15,78,89,107,119,156,167,172,199,235,245,291,307,350,359,396],"two":[4],"parts.":[5],"Part":[6,305],"I":[7],"the":[9,22,44,76,81,87,104,130,159,219,246,304,308],"deals":[11],"with":[12,55,185,279],"spanning":[13],"subgraphs":[14],"dense":[16],"graphs.":[17],"In":[18],"particular,":[19],"we":[20,122,139,217,238,310],"present":[21,362],"following":[23,45],"results:":[24],"\r\n(1)":[25],"We":[26,201,211,361],"show":[27,123,140,239],"that":[28,43,86,97,124,132,141,150,253,268],"for":[29,111,142,205,254,419],"every":[30,255],"\u03940":[31,148],"and":[32,109,177,301,323,333,370,378,409],"\u03b3":[33],">":[34,40],"0":[35,41],"there":[36,145,261],"is":[37,50,80,127,146,163,179,196,262,271,338,352,384,400,407],"an":[38,51,363,371,375],"\u03b1":[39],"such":[42,85,96,149,267,380],"statement":[46],"holds:":[47],"If":[48,161],"G":[49,62,178,270,286],"n":[52,65,183,275],"vertex":[53,66,169,288],"graph":[54,165,181,273],"minimum":[56,186,280],"degree":[57,187,281],"at":[58,188],"least":[59,82,189],"n2+gn":[60],"then":[61,135,194,285],"contains":[63,287],"all":[64,206],"bipartite":[67],"graphs,":[68],"H,":[69,79,257],"satisfying":[70,175],"DH\u2264D":[71],"0andb":[72],"H\u2264an.":[73],"Here":[74],"b(H),":[75],"bandwidth":[77],"number":[83],"b":[84],"vertices":[88,184,260,278],"H":[90,162,195,284],"can":[91,226],"be":[92,329,341],"ordered":[93],"as":[94],"v1,l,vn":[95],"vi,vj":[98],"\u2208EH":[99],"implies":[100],"i-j\u2264b.":[101],"settles":[103],"embedding":[105],"conjecture":[106,126,155,204,251,294],"Bollobas":[108],"Komlos":[110],"k":[112,347,356,377],"=":[113,276],"2.":[114],"\r\n(2)":[115],"Answering":[116],"a":[117,147,164,197,213,243,263,312,330,393],"question":[118],"E.":[120],"Szemeredi":[121],"this":[125,203,223,236],"tight":[128],"in":[129,320],"sense":[131],"if":[133,269,345],"g\u21920":[134],"a\u21920.":[136],"More":[137],"precisely,":[138],"any":[143,180,272,355],"g\u22641100":[144],"aD0,g":[151],"\u22644g.":[152],"\r\n(3)":[153],"A":[154,335],"EI-Zahar":[157],"asserts":[158],"following:":[160],"consisting":[166],"r":[168],"disjoint":[170,289],"cycles":[171],"length":[173,348,357,397],"n1,n2,l,nr":[174],"n1+n2+c+nr=n":[176],"on":[182,258,274,315,367],"n12":[190],"+n22":[191],"+c+ni2":[192],",":[193],"subgraph":[198],"G.":[200],"prove":[202,212],"sufficiently":[207],"large":[208],"n.":[209],"\r\n(4)":[210],"general":[214],"theorem":[215,224,237],"which":[216,366,399],"call":[218],"Decomposition":[220],"theorem.":[221],"Using":[222],"one":[225],"obtain":[227,242],"many":[228],"known":[229],"results":[230],"quite":[231],"easily.":[232],"As":[233],"application":[234],"how":[240],"to":[241,340,343,354,386,403,416],"proof":[244],"Alon-Yuster":[247,250],"conjecture.":[248],"The":[249],"states":[252],"graph,":[256],"h":[259],"constant":[264],"C(":[265],"H)":[266],"Nh":[277],"1-1cH":[282],"n+C":[283],"copies":[290],"H.":[292],"was":[295],"first":[296],"solved":[297],"by":[298,413],"Komlos,":[299],"Sarkozy":[300],"Szemeredi.":[302],"\r\nIn":[303],"II":[306],"consider":[311],"combinatorial":[313],"problem":[314,318],"strings.":[316],"arises":[319],"Molecular":[321],"Biology":[322],"has":[324,410],"practical":[325,408],"applications.":[326],"\r\nLet":[327],"\u03a3":[328],"finite":[331],"alphabet":[332],"x\u2208Sn.":[334],"string":[336,394],"y\u2208Sm":[337,379],"said":[339],"k-dissimilar":[342,385],"x,":[344],"no":[346],"substring":[349,358],"x":[351],"equal":[353],"y.":[360],"Onlogn":[364],"algorithm":[365,406],"input":[368],"x\u2208Sn":[369],"integer":[372,376],"m\u2264n":[373],"outputs":[374],"that:":[381],"(1)":[382],"y":[383],"x.":[387,404],"(2)":[388],"There":[389],"does":[390],"not":[391],"exist":[392],"z":[395],"m":[398],"k-1":[401],"dissimilar":[402],"\r\nThe":[405],"been":[411],"used":[412],"molecular":[414],"biologist":[415],"design":[417],"DNA":[418],"certain":[420],"experiments.":[421]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-09-23T00:00:00"}