39 citations · 93 across the 25 of their papers we have counts for
6 papers · 1 filter
On graphs without cycles of length 0 modulo 4
Ervin Győri, Binlong Li, Nika Salia +3
Bollobás proved that for every and such that contains an even number, an -vertex graph containing no cycle of length can contain at…
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 -vertex graph containing all -vertex trees as a subgraph. They showed that such a graph has at…
Maximum cliques in a graph without disjoint given subgraph
Fangfang Zhang, Yaojun Chen, Ervin Gyori +1
The generalized Turán number $\ex(n,K_s,F)$ denotes the maximum number of copies of in an -vertex -free graph. Let denote disjoint copies of . Gerbner, Meth…
On the Small Quasi-kernel conjecture
Péter L. Erdős, Ervin Győri, Tamás Róbert Mezei +2
An independent vertex subset of the directed graph is a kernel if the set of out-neighbors of is . An independent vertex subset of is a quasi-k…
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 -vertex…
On the rainbow planar Turán number of paths
Ervin Győri, Ryan R. Martin, Addisu Paulos +2
An edge-colored graph is said to contain a rainbow- if it contains as a subgraph and every edge of is a distinct color. The problem of maximizing edges among -vertex…