Abstract
Recently we have developed a method excluding certain subgraphs from a smallest counterexample to the 5-flow conjecture. This is based on comparing ranks of two matrices of large size. The aim of this paper is to be more effective by applying these methods so that we reduce the size of matrices used in the computation.
Supported by grants VEGA 2/0118/10 and RI 5/06 DFM.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Isaacs, R.: Infinite families of nontrivial trivalent graphs which are not Tait colorable. Amer. Math. Monthly 82, 221–239 (1975)
Jaeger, F.: Nowhere-zero flow problems. In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory, vol. 3, pp. 71–95. Academic Press, London (1988)
Kochol, M.: Superposition and constructions of graphs without nowhere-zero k-flows. European J. Combin. 23, 281–306 (2002)
Kochol, M.: Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks. J. Combin. Theory Ser. B 90, 139–145 (2004)
Kochol, M.: Girth restrictions for the 5-flow conjecture. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 705–707 (2005)
Kochol, M., Krivoňáková, N., Smejová, S., Šranková, K.: Counting nowhere-zero flows on wheels. Discrete Math. 308, 2050–2053 (2008)
Tutte, W.T.: A contribution to the theory of chromatic polynomials. Canad. J. Math. 6, 80–91 (1954)
Tutte, W.T.: A class of Abelian groups. Canad. J. Math. 8, 13–28 (1956)
Zhang, C.-Q.: Integral Flows and Cycle Covers of Graphs. Dekker, New York (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kochol, M., Krivoňáková, N., Smejová, S., Šranková, K. (2011). Reductions of Matrices Associated with Nowhere-Zero Flows. In: Iliopoulos, C.S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2010. Lecture Notes in Computer Science, vol 6460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19222-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-19222-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19221-0
Online ISBN: 978-3-642-19222-7
eBook Packages: Computer ScienceComputer Science (R0)