5 papers
Generalized planar Turán numbers related to short cycles
Ervin Győri, Hilal Hama Karim
Given two graphs and , the generalized planar Turán number is the maximum number of copies of that an -vertex -free planar graph c…
The anti-Ramsey numbers of cliques in complete multi-partite graphs
Yuyu An, Ervin Gyori, Binlong Li
A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. Let and be two graphs. The anti-Ramsey number $\ar(G, H)$ is the maximum number of…
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…