2 papers
math.CO2024
A sharp upper bound on the spectral radius of -free graphs with given size
Yuxiang Liu, Ligong Wang
A graph is -free if does not contain as a subgraph. Let be the spectral radius of a graph . Let denote the theta graph, which is obtained by c…
math.CO2024
Connected Turán numbers for Berge paths in hypergraphs
Lin-Peng Zhang, Hajo Broersma, Ervin GyÅri +2
Let be a family of -uniform hypergraphs. Denote by $\ex^{\mathrm{conn}}_r(n,\mathcal{F})$ the maximum number of hyperedges in an -vertex connected -uniform h…