3 papers
math.CO2024
Jones' conjecture for Halin graphs and a bit more
Pál Bärnkopf, Ervin Győri
We prove Jones' famous conjecture for Halin graphs and a somewhat more general class of graphs, too. A based planar graph is a planar one that has a face adjacent to every other fa…
math.CO2023
Extending edge colorings of distance-3 matchings in the Cartesian product of graphs
Pál Bärnkopf, Ervin Győri
We investigate the problem of extending partial edge colorings in Cartesian products of graphs, with a particular focus on cases where the precolored edges form a matching. Casselg…
math.CO2022
The maximum number of cliques in graphs with bounded odd circumference
Zequn Lv, Ervin Győri, Zhen He +3
In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Turán-type result is an extension of the celebrate…