An Algebraic Characterization of Rainbow Connectivity
The use of algebraic techniques to solve combinatorial problems is studied in this paper. We formulate the rainbow connectivity problem as a system of polynomial equations. We first consider the case of two colors for which the problem is known to be hard and we then extend the approach to the general case. We also present a formulation of the rainbow connectivity problem as an ideal membership problem.
KeywordsGraphs NulLA alogirithm ideal membership
Unable to display preview. Download preview PDF.
- 4.De Loera, J., Lee, J., Malkin, P., Margulies, S.: Hilbert’s Nullstellensatz and an algorithm for proving combinatorial infeasibility. In: ISSAC 2008: Proceedings of the Twenty-first International Symposium on Symbolic and Algebraic Computation, pp. 197–206. ACM (2008)Google Scholar
- 5.Margulies, S.: Computer algebra, combinatorics, and complexity: Hilberts Nullstellensatz and NP-complete problems. PhD thesis, University of California (2008)Google Scholar
- 6.Bayer, D.: The division algorithm and the Hilbert scheme. PhD thesis, Harvard University (1982)Google Scholar
- 7.Cox, D.A., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms, 3rd edn. Undergraduate Texts in Mathematics. Springer (2007)Google Scholar
- 8.Kollár, J.: Sharp effective Nullstellensatz. American Mathematical Society 1(4) (1988)Google Scholar