学位论文详细信息
Algebraic Methods for Reducibility in Nowhere-Zero Flows
graph theory;nowhere-zero flow;reducibility;algebraic method;equalities;inequalities;Combinatorics and Optimization
Li, Zhentao
University of Waterloo
关键词: graph theory;    nowhere-zero flow;    reducibility;    algebraic method;    equalities;    inequalities;    Combinatorics and Optimization;   
Others  :  https://uwspace.uwaterloo.ca/bitstream/10012/3307/1/eq10formatted.pdf
瑞士|英语
来源: UWSPACE Waterloo Institutional Repository
PDF
【 摘 要 】

We study reducibility for nowhere-zero flows. A reducibility proof typically consists of showing that some induced subgraphs cannot appear in a minimum counter-example to some conjecture. We derive algebraic proofs of reducibility. We define variables which in some sense count the number of nowhere-zero flows of certain type in a graph and then deduce equalities and inequalities that must hold for all graphs. We then show how to use these algebraic expressions to prove reducibility. In our case, these inequalities and equalities are linear. We can thus use the well developed theory of linear programming to obtain certificates of these proof.We make publicly available computer programs we wrote to generate the algebraic expressions and obtain the certificates.

【 预 览 】
附件列表
Files Size Format View
Algebraic Methods for Reducibility in Nowhere-Zero Flows 570KB PDF download
  文献评价指标  
  下载次数:65次 浏览次数:22次