Is the five-flow conjecture almost false?
From MaRDI portal
Publication:463296
DOI10.1016/J.JCTB.2013.06.001zbMath1301.05153arXiv1009.4062OpenAlexW2050188822WikidataQ58082143 ScholiaQ58082143MaRDI QIDQ463296
Jesper Lykke Jacobsen, Jesús Salas
Publication date: 16 October 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.4062
transfer matrixPetersen graphflow polynomialnowhere zero flowsflow rootsTutte's five-flow conjecture
Related Items (6)
On zeros of the characteristic polynomial of matroids of bounded tree-width ⋮ Phase diagram of the triangular-lattice Potts antiferromagnet ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with extra-vertex boundary conditions ⋮ Density of Real Zeros of the Tutte Polynomial ⋮ A generalized Beraha conjecture for non-planar graphs ⋮ On graphs having no flow roots in the interval \((1,2)\)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partition algebras.
- A zero-free interval for flow polynomials of cubic graphs
- Character decomposition of Potts model partition functions. I: Cyclic geometry
- Eigenvalue amplitudes of the Potts model on a torus
- Planar triangulations with real chromatic roots arbitrarily close to 4
- Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids
- Flows and generalized coloring theorems in graphs
- Limits of chromatic zeros of some families of maps
- Nowhere-zero 6-flows
- Is the four-color conjecture almost false?
- Every planar map is four colorable. I: Discharging
- The largest real zero of the chromatic polynomial
- Zeros of chromatic and flow polynomials of graphs
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Exact Potts model partition functions for strips of the square lattice
- The structure of the partition algebras
- Potts model and graph theory.
- Phase diagram of the chromatic polynomial on a torus
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. IV. Chromatic polynomial with cyclic boundary conditions
- Restrictions on smallest counterexamples to the 5-flow conjecture
- Every generalized Petersen graph has a Tait coloring
- Computing Tutte Polynomials
- A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
- Tutte's 5-flow conjecture for the projective plane
- Limits of zeroes of recursively defined polynomials
- COLOURING, PACKING AND THE CRITICAL PROBLEM
- The Zero-Free Intervals for Characteristic Polynomials of Matroids
- The Zero-Free Intervals for Chromatic Polynomials of Graphs
- Chromatic Roots are Dense in the Whole Complex Plane
- Combinatorial aspects of boundary loop models
- A theorem on tait colorings with an application to the generalized Petersen graphs
- On the Imbedding of Linear Graphs in Surfaces
- A Contribution to the Theory of Chromatic Polynomials
- Chromatic Polynomials
- A generalized Beraha conjecture for non-planar graphs
This page was built for publication: Is the five-flow conjecture almost false?