Showing 2023Show all
2 papers · 1 filter
math.CO2023
Majority distinguishing edge coloring
Aleksandra Gorzkowska, Magdalena Prorok
We consider edge colorings of graphs. An edge coloring is a majority coloring if for every vertex at most half of the edges incident with it are in one color. And edge coloring is…
math.CO2023
Directed graphs without rainbow triangles
Sebastian Babiński, Andrzej Grzesik, Magdalena Prorok
One of the most fundamental results in graph theory is Mantel's theorem which determines the maximum number of edges in a triangle-free graph of order . Recently a colorful vari…