{"id":"https://openalex.org/W4416802211","doi":"https://doi.org/10.37236/12197","title":"Tur\u00e1n Number for Bushes","display_name":"Tur\u00e1n Number for Bushes","publication_year":2025,"publication_date":"2025-11-28","ids":{"openalex":"https://openalex.org/W4416802211","doi":"https://doi.org/10.37236/12197"},"language":null,"primary_location":{"id":"doi:10.37236/12197","is_oa":true,"landing_page_url":"https://doi.org/10.37236/12197","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p55/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":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p55/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120482418","display_name":"Alexandr Kostochka","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexandr Kostochka","raw_affiliation_strings":["University of Illinois at Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023439517","display_name":"Zolt\u00e1n F\u00fcredi","orcid":"https://orcid.org/0000-0001-7335-991X"},"institutions":[{"id":"https://openalex.org/I127817813","display_name":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics","ror":"https://ror.org/03vw74f64","country_code":"HU","type":"facility","lineage":["https://openalex.org/I127817813","https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Zolt\u00e1n F\u00fcredi","raw_affiliation_strings":["Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Budapest, Hungary","institution_ids":["https://openalex.org/I127817813"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.48928904,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"4","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.9879999756813049,"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.9879999756813049,"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.002300000051036477,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.0013000000035390258,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/hypergraph","display_name":"Hypergraph","score":0.7231000065803528},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6323000192642212},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.578000009059906},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5411999821662903},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.37599998712539673},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.35499998927116394}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7623000144958496},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7231000065803528},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6481000185012817},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6323000192642212},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.578000009059906},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5411999821662903},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4756999909877777},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.37599998712539673},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.35499998927116394},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.34209999442100525},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.304500013589859},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.2581999897956848},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.2538999915122986}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/12197","is_oa":true,"landing_page_url":"https://doi.org/10.37236/12197","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p55/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":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/12197","is_oa":true,"landing_page_url":"https://doi.org/10.37236/12197","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p55/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":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G154586071","display_name":null,"funder_award_id":"DMS-1937241","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3255774899","display_name":null,"funder_award_id":"133819","funder_id":"https://openalex.org/F4320326762","funder_display_name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal"},{"id":"https://openalex.org/G5991973239","display_name":"Existence of Specific Paths, Cycles, and Colorings in Graphs and Hypergraphs","funder_award_id":"2153507","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8550484722","display_name":null,"funder_award_id":"132696","funder_id":"https://openalex.org/F4320326762","funder_display_name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320326762","display_name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","ror":null},{"id":"https://openalex.org/F4320336675","display_name":"National Research, Development and Innovation Office","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416802211.pdf","grobid_xml":"https://content.openalex.org/works/W4416802211.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Let":[0,24],"$":[1,106],"a,b":[2],"\\in":[3,59],"{\\bf":[4,74],"Z}^+$,":[5,75],"$r=a":[6],"+":[7],"b$,":[8],"and":[9,20,28,38,80],"let":[10],"$T$":[11,46,81],"be":[12,32],"a":[13,83,102],"tree":[14,85],"with":[15,51],"parts":[16],"$U":[17],"=":[18,22],"\\{u_1,u_2,\\dots,u_s\\}$":[19],"$V":[21],"\\{v_1,v_2,\\dots,v_t\\}$.":[23],"$U_1,":[25],"\\dots":[26],",U_s$":[27],"$V_1,":[29],"\\dots,":[30],"V_t$":[31],"disjoint":[33],"sets,":[34],"such":[35,104],"that":[36,105],"$|U_i|=a$":[37],"$|V_j|=b$":[39],"for":[40,111],"all":[41],"$i,j$.":[42],"The":[43],"$(a,b)$-blowup":[44,120],"of":[45,86,93,121],"is":[47,82,97,124,133],"the":[48,63,68,91,94],"$r$-uniform":[49,114],"hypergraph":[50,115],"edge":[52],"set$":[53],"{\\{U_i":[54],"\\cup":[55],"V_j":[56],":":[57],"u_iv_j":[58],"E(T)\\}.}$":[60],"We":[61],"use":[62],"$\\Delta$-systems":[64],"method":[65],"to":[66],"prove":[67],"following":[69],"Tur\u00e1n-type":[70],"result.":[71],"Suppose":[72],"$a,b,t\\in":[73],"$r=a+b\\geq":[76],"3$,":[77],"$a\\geq":[78],"2$,":[79],"fixed":[84],"diameter":[87],"$4$":[88],"in":[89],"which":[90],"degree":[92],"center":[95],"vertex":[96],"$t$.":[98],"Then":[99],"there":[100],"exists":[101],"$C=C(r,t,T)>0$":[103],"|\\mathcal{H}|\\leq":[107],"(t-1){n\\choose":[108],"r-1}":[109],"+Cn^{r-2}$":[110],"every":[112],"$n$-vertex":[113],"$\\mathcal{H}$":[116],"not":[117],"containing":[118],"an":[119],"$T$.":[122],"This":[123],"asymptotically":[125],"exact":[126],"when":[127],"$t\\leq":[128],"|V(T)|/2$.":[129],"A":[130],"stability":[131],"result":[132],"also":[134],"presented.":[135]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-11-28T00:00:00"}