2 papers
math.CO2024
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…
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 -vertex graph containing all -vertex trees as a subgraph. They showed that such a graph has at…