Skip to main content
SpringerLink
Log in

Reductions of Matrices Associated with Nowhere-Zero Flows

  • Conference paper
Combinatorial Algorithms (IWOCA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6460))

Included in the following conference series:

  • 707 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Isaacs, R.: Infinite families of nontrivial trivalent graphs which are not Tait colorable. Amer. Math. Monthly 82, 221–239 (1975)

    Article  MATH  Google Scholar 

  2. 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)

    Google Scholar 

  3. Kochol, M.: Superposition and constructions of graphs without nowhere-zero k-flows. European J. Combin. 23, 281–306 (2002)

    Article  MATH  Google Scholar 

  4. Kochol, M.: Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks. J. Combin. Theory Ser. B 90, 139–145 (2004)

    Article  MATH  Google Scholar 

  5. 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)

    Google Scholar 

  6. Kochol, M., Krivoňáková, N., Smejová, S., Šranková, K.: Counting nowhere-zero flows on wheels. Discrete Math. 308, 2050–2053 (2008)

    Article  MATH  Google Scholar 

  7. Tutte, W.T.: A contribution to the theory of chromatic polynomials. Canad. J. Math. 6, 80–91 (1954)

    Article  MATH  Google Scholar 

  8. Tutte, W.T.: A class of Abelian groups. Canad. J. Math. 8, 13–28 (1956)

    Article  MATH  Google Scholar 

  9. Zhang, C.-Q.: Integral Flows and Cycle Covers of Graphs. Dekker, New York (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MÚ SAV, Štefánikova 49, 814 73, Bratislava 1, Slovakia

    Martin Kochol

  2. FPV ŽU, Univerzitná 8215/1, 010 26, Žilina, Slovakia

    Nad’a Krivoňáková, Silvia Smejová & Katarína Šranková

Authors
  1. Martin Kochol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nad’a Krivoňáková
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Silvia Smejová
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Katarína Šranková
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of London, King’s College, The Strand, WC2R 2LS, London, UK

    Costas S. Iliopoulos

  2. Department of Computing and Software, McMaster University, 1280 Main Street West, L8S 4K1, Hamilton, ON, Canada

    William F. Smyth

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation