Matrix reduction in a combinatorial computation

DOI10.1016/J.IPL.2010.11.008zbMATH Open1259.05072OpenAlexW2078897456MaRDI QIDQ1944064FDOQ1944064

Authors: Martin Kochol, Nad'a Krivoňáková, Silvia Smejová, Katarína Šranková 

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.11.008

Recommendations

• Reductions of matrices associated with nowhere-zero flows
• Smallest counterexample to the 5-flow conjecture has girth at least eleven
• An equivalent version of the 3-flow conjecture
• About Counterexamples to The 5-Flow Conjecture
• Tutte's 5-flow conjecture for the projective plane

zbMATH Keywords

rank of a matrixcombinatorial problemsgirth of a graphnowhere-zero \(5\)-flow

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Flows in graphs (05C21)

Cites Work

• A Contribution to the Theory of Chromatic Polynomials
• Title not available (Why is that?)
• A Class Of Abelian Groups
• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• Smallest counterexample to the 5-flow conjecture has girth at least eleven
• Restrictions on smallest counterexamples to the 5-flow conjecture
• Superposition and constructions of graphs without nowhere-zero \(k\)-flows
• Counting nowhere-zero flows on wheels
• Decomposition formulas for the flow polynomial

Cited In (7)

• Title not available (Why is that?)
• Combinatorics in tensor-integral reduction
• Reductions of matrices associated with nowhere-zero flows
• Reduced form of the interactor matrix
• Smallest counterexample to the 5-flow conjecture has girth at least eleven
• Families of Algorithms for Reducing a Matrix to Condensed Form
• Reduction of a matrix using properties of the Schur complement

This page was built for publication: Matrix reduction in a combinatorial computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944064)