45 citations · 53 across the 5 of their papers we have counts for
5 papers
Canonical theorems for colored integers with respect to some linear combinations
Maria Axenovich, David S. Gunderson, Hanno Lefmann
Hindman proved in 1979 that no matter how natural numbers are colored in r colors, for a fixed positive integer r, there is an infinite subset X of numbers and a color t such that…
Properties of the Fibonacci-sum graph
Andrii Arman, David S. Gunderson, Pak Ching Li
For each positive integer , the Fibonacci-sum graph on vertices is defined by two vertices forming an edge if and only if they sum to a Fibonacci number. It…
Triangle-free graphs with the maximum number of cycles
Andrii Arman, David S. Gunderson, Sergei Tsaturian
It is shown that for , among all triangle-free graphs on vertices, the complete equibipartite graph is the unique triangle-free graph with the greatest number of cyc…
Extremal numbers for odd cycles
Zoltan Füredi, David S. Gunderson
We describe the C_{2k+1}-free graphs on n vertices with maximum number of edges. The extremal graphs are unique except for n = 3k-1, 3k, 4k-2, or 4k-1. The value of ex(n,C_{2k+1})…
Cycle-maximal triangle-free graphs
Stephane Durocher, David S. Gunderson, Pak Ching Li +1
We conjecture that the balanced complete bipartite graph contains more cycles than any other -vertex triangle-free graph, and we make…