Anti-van der Waerden numbers on graphs
From MaRDI portal
Publication:2159226
Abstract: In this paper arithmetic progressions on the integers and the integers modulo n are extended to graphs. This allows for the definition of the anti-van der Waerden number of a graph. Much of the focus of this paper is on 3-term arithmetic progressions for which general bounds are obtained based on the radius and diameter of a graph. The general bounds are improved for trees and Cartesian products and exact values are determined for some classes of graphs. Larger k-term arithmetic progressions are considered and a connection between the Ramsey number of paths and the anti-van der Waerden number of graphs is established.
Recommendations
Cites work
- scientific article; zbMATH DE number 3494450 (Why is no real title available?)
- scientific article; zbMATH DE number 3262254 (Why is no real title available?)
- Anti-van der Waerden numbers of 3-term arithmetic progression
- Anti-van der Waerden numbers of graph products
- On rainbow arithmetic progressions
- Rainbow Arithmetic Progressions and Anti-Ramsey Results
- Rainbow arithmetic progressions
- Rainbow arithmetic progressions in finite abelian groups
- Rainbow generalizations of Ramsey theory: A survey
- Sub-Ramsey numbers for arithmetic progressions
Cited in
(3)
This page was built for publication: Anti-van der Waerden numbers on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2159226)