Proceedings of the first Malta conference on Graphs and combinatorics
A note on graph colorings and graph polynomials
Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
The division algorithm and the hilbert scheme
The division algorithm and the hilbert scheme
Combinatorics, Probability and Computing
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Expressing combinatorial problems by systems of polynomial equations and hilbert's nullstellensatz
Combinatorics, Probability and Computing
Computer algebra, combinatorics, and complexity: hilbert's nullstellensatz and np-complete problems
Computer algebra, combinatorics, and complexity: hilbert's nullstellensatz and np-complete problems
| Hi-index | 0.00 |
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.