Nika Salia

most citedStability version of Dirac's theorem and its applications for generalized Turán problems

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2023

A note on universal graphs for spanning trees

Ervin Győri, Binlong Li, Nika Salia +1

Chung and Graham considered the problem of minimizing the number of edges in an $n$ -vertex graph containing all $n$ -vertex trees as a subgraph. They showed that such a graph has at…

math.CO2023

The maximum Wiener index of a uniform hypergraph

Stijn Cambie, Ervin Győri, Nika Salia +2

The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected $n$ -vertex…

math.CO2022

Exact results for generalized extremal problems forbidding an even cycle

Ervin Győri, Zhen He, Zequn Lv +4

We determine the maximum number of copies of $K_{s, s}$ in a $C_{2 s + 2}$ -free $n$ -vertex graph for all integers $s \geq 2$ and sufficiently large $n$ . Moreover, for $s \in {2, 3}$ and…

math.CO2022★ 1 cited

Stability version of Dirac's theorem and its applications for generalized Turán problems

Xiutao Zhu, Ervin Győri, Zhen He +3

In 1952, Dirac proved that every $2$ -connected $n$ -vertex graph with the minimum degree $k + 1$ contains a cycle of length at least $min {n, 2 (k + 1)}$ . Here we obtain a stability ve…