Edge mappings of graphs: Ramsey type parameters
Abstract
In this paper, we address problems related to parameters concerning edge mappings of graphs. Inspired by Ramsey's Theorem, the quantity m(G, H) is defined to be the minimum number n such that for every f: E(Kn) → E(Kn) either there is a fixed copy of G with f ( e) = e for all e∈ E(G), or a free copy of H with f( e) E(H) for all e∈ E(H). We extend many old results from the 80's as well as proving many new results. We also consider several new interesting parameters with the same spirit.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.