View Proposal #492
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
ID | 492 |
---|---|
First Name | Alex |
Last Name | Schulte |
Institution | Iowa State University |
Speaker Category | faculty |
Title of Talk | Anti-Van der Waerden number of 3-term arithmetic progression |
Abstract | A set is rainbow if each element of the set is a dierent color. The anti-van der Waerden number of the integers from 1 to n, denoted by aw([n]; k), is the least positive integer r such that every exact r-coloring of [n] contains a rainbow k-term arithmetic progression. The exact value of the anti-van der Waerden number of the integers where k = 3 is given by aw([n]; 3) = dlog3 ne+2. The anti-van der Waerden number can also be dened on graphs, where aw(G; k) is the least number of colors such that every coloring contains a rainbow k-term arithmetic progression. Bounds on the anti-van der Wareden number of graphs have been established and exact values are known for certain families of graphs. Keywords: Rainbow, r |
Subject area(s) | |
Suitable for undergraduates? | ? |
Day Preference | none |
Computer Needed? | |
Bringing a laptop? | |
Overhead Needed? | |
Software requests | |
Special Needs | |
Date Submitted | 10/13/2017 |
Year | 2017 |