DMS Graduate Student Seminar

Speaker: Isabel Harris, Auburn University 

Title: A Necessary Condition for Ar_k – Bounded Graphs

Abstract: Abstract: A simple graph with e = E(G) avoids a k-rainbow coloring if any color appears on at least k+1 edges of G. For k ∈ P, AR_k(G, n) is the maximum number of colors in an edge coloring of K_n so that in every copy of G, some color occurs on at least k+1 edges. G is AR_k-bounded if AR_k(G,n) ≤ c for some c ∈ P and all n sufficiently large. This talk will discuss a necessary condition for classifying graphs into AR_k-bounded or AR_k-unbounded.