33 citations · 164 across the 61 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.CO2013
Online and size anti-Ramsey numbers
Maria Axenovich, Kolja Knauer, Judith Stumpp +1
A graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges in a graph any of whose proper edge colorings contains a totally multico…
math.CO2013★ 6 cited
Twins in graphs
Maria Axenovich, Ryan R. Martin, Torsten Ueckerdt
A basic pigeonhole principle insures an existence of two objects of the same type if the number of objects is larger than the number of types. Can such a principle be extended to a…
math.CO2013
Multicolor Ramsey numbers for triple systems
Maria Axenovich, Andras Gyarfas, Hong Liu +1
Given an -uniform hypergraph , the multicolor Ramsey number is the minimum such that every -coloring of the edges of the complete -uniform hypergraph $K_n^…