Showing 2023Show all
2 papers · 1 filter
math.CO2023
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…
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…