Presentation
Some Applications of Two Techniques in Graph Theory: The Combinatorial Nullstellensatz and the Discharging Method
CACM (Center for Applied and Computational Mathematics) Seminar
(2016)
Abstract
Discharging method is a tool in a two-step approach to inductive proofs of some problems in graph theory. It is used to prove that a global hypothesis guarantees the existence of some desirable local configurations. The Combinatorial Nullstellensatz is an algebraic tool in combinatorics and number theory. In graph theory it is applied to prove the existence of certain configurations or labelings in graphs. In this talk we see applications of these two techniques in some graph coloring and graph labeling problems​.
Disciplines
Publication Date
November 8, 2016
Location
Rochester, NY
Citation Information
Sogol Jahanbekam. "Some Applications of Two Techniques in Graph Theory: The Combinatorial Nullstellensatz and the Discharging Method" CACM (Center for Applied and Computational Mathematics) Seminar (2016) Available at: http://works.bepress.com/sogol-jahanbekam/39/