{"id":"https://openalex.org/W7154249808","doi":"https://doi.org/10.48550/arxiv.2604.10467","title":"An Upper Bound on the Linear Tur\u00e1n Number of $k$-Crowns","display_name":"An Upper Bound on the Linear Tur\u00e1n Number of $k$-Crowns","publication_year":2026,"publication_date":"2026-04-12","ids":{"openalex":"https://openalex.org/W7154249808","doi":"https://doi.org/10.48550/arxiv.2604.10467"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.10467","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.10467","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.10467","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123992553","display_name":"Rajat Adak","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Adak, Rajat","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5123992553"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9805999994277954,"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.9805999994277954,"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.005200000014156103,"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/T12303","display_name":"Tensor decomposition and applications","score":0.00279999990016222,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"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/disjoint-sets","display_name":"Disjoint sets","score":0.7401000261306763},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7228999733924866},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.6668999791145325},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6287000179290771},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.490200012922287},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.39399999380111694}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8367000222206116},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7814000248908997},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7401000261306763},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7228999733924866},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6668999791145325},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6287000179290771},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.490200012922287},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4681999981403351},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.39399999380111694},{"id":"https://openalex.org/C49766605","wikidata":"https://www.wikidata.org/wiki/Q207643","display_name":"Linear map","level":2,"score":0.36480000615119934},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.36070001125335693},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.2745000123977661},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.26089999079704285}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.10467","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.10467","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.10467","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.10467","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"hypergraph":[1],"$H$":[2,31],"is":[3,32,68],"said":[4,33],"to":[5,34,140,212],"be":[6,35,141,222],"\\emph{linear}":[7],"if":[8,37],"every":[9],"pair":[10],"of":[11,23,42,56,85,98,109,123,130,146,181],"vertices":[12],"lies":[13],"in":[14,58,87,160,175,187],"at":[15],"most":[16],"one":[17,147],"hyperedge.":[18],"Given":[19],"a":[20,45,69,88,131,135,142,161],"family":[21],"$\\mathcal{F}$":[22,43],"$r$-uniform":[24],"hypergraphs":[25],"(also":[26],"called":[27],"$r$-graphs),":[28],"an":[29,59,80,169],"$r$-graph":[30,62,144],"\\emph{$\\mathcal{F}$-free}":[36],"it":[38],"contains":[39],"no":[40],"member":[41],"as":[44],"subhypergraph.":[46],"The":[47,66],"\\emph{linear":[48],"Tur\u00e1n":[49,96,114],"number}":[50],"$ex_r^{\\mathrm{lin}}(n,\\mathcal{F})$":[51],"denotes":[52],"the":[53,107,112,124,128,158,178,208,213],"maximum":[54],"number":[55,115],"edges":[57,77],"$\\mathcal{F}$-free":[60],"linear":[61,70,113,119,143,215],"on":[63,111,172],"$n$":[64],"vertices.":[65],"crown":[67,132],"$3$-graph":[71],"obtained":[72],"from":[73],"three":[74],"pairwise":[75,153],"disjoint":[76,154],"by":[78,133,138],"adding":[79],"edge":[81,149],"that":[82,122,207],"intersects":[83],"each":[84,156],"them":[86],"distinct":[89,162],"vertex.":[90,163],"Recently,":[91],"Gy\u00e1rf\u00e1s,":[92],"Ruszink\u00f3,":[93],"and":[94,184,218,220],"S\u00e1rk\u00f6zy~[\\emph{Linear":[95],"numbers":[97],"acyclic":[99,117],"triple":[100],"systems},":[101],"European":[102],"J.\\":[103,191],"Combin.\\":[104,192],"(2022)]":[105],"initiated":[106],"study":[108],"bounds":[110],"for":[116,194],"$3$-uniform":[118],"hypergraphs,":[120],"including":[121],"crown.":[125],"We":[126,204],"extend":[127],"notion":[129],"defining":[134],"$k$-crown,":[136],"denoted":[137],"$C_{1,k}^r$,":[139],"consisting":[145],"base":[148,159],"together":[150],"with":[151],"$k$":[152],"edges,":[155],"intersecting":[157],"In":[164],"this":[165],"paper,":[166],"we":[167],"establish":[168],"upper":[170],"bound":[171,180],"$ex_r^{\\mathrm{lin}}(n,C_{1,k}^r)$,":[173],"which":[174],"particular":[176],"improves":[177],"recent":[179],"Zhang,":[182],"Broersma,":[183],"Wang~[\\emph{Generalized":[185],"Crowns":[186],"Linear":[188],"$r$-Graphs},":[189],"Electron.\\":[190],"(2025)]":[193],"all":[195],"$r":[196],"\\geq":[197],"4$,":[198],"without":[199],"forbidding":[200],"any":[201],"auxiliary":[202],"configuration.":[203],"also":[205],"note":[206],"cases":[209],"$k\\in\\{1,2\\}$":[210],"correspond":[211],"short":[214],"paths":[216],"$P_2^r$":[217],"$P_3^r$,":[219],"can":[221],"treated":[223],"separately.":[224]},"counts_by_year":[],"updated_date":"2026-04-15T06:04:33.058270","created_date":"2026-04-15T00:00:00"}