Sul-Young Choi

Learn More
A subsequence of a sequence of integers is said to be sum-free if no integer of the subsequence is the sum of distinct integers of this same subsequence. In this paper we shall prove, provided n is sufficiently large, that there exists a sequence of n integers whose largest sum-free subsequence has at most c/i(log log n)-1/2 integers, where c is an absolute(More)
Given a labeling of the vertices and edges of a graph, we define a type of homo-geneity that requires that the neighborhood of every vertex contains the same number of each of the labels. This homogeneity constraint is a generalization of regularity – all such graphs are regular. We consider a specific condition in which both the edge and vertex label sets(More)
  • 1