GC
2016
Springer
8 years 23 days ago
2016
Springer
GC
2016
Springer
8 years 23 days ago
2016
Springer
Let s(n, t) be the maximum number of colors in an edge-coloring of the complete graph Kn that has no rainbow spanning subgraph with diameter at most t. We prove s(n, t) = n−2 2 ...
GC
2016
Springer
8 years 23 days ago
2016
Springer
GC
2016
Springer
8 years 23 days ago
2016
Springer
A mixed hypergraph is a triple H = (V, C, D), where V is a set of vertices, C and D are sets of hyperedges. A vertex-coloring of H is proper if C-edges are not totally multicolored...
GC
2016
Springer
8 years 23 days ago
2016
Springer
The pseudoachromatic index of a graph is the maximum number of colors that can be assigned to its edges, such that each pair of different colors is incident to a common vertex. I...