On zeros of the characteristic polynomial of matroids of bounded tree-width

DOI10.1016/j.ejc.2016.08.011zbMath1348.05047arXiv1703.02393OpenAlexW2521065696MaRDI QIDQ338570

Carolyn Chun, Criel Merino, Rhiannon Hall, Steven D. Noble

Publication date: 7 November 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.02393

zbMATH Keywords

\(\mathrm{GF}(q)\)-representable matroid

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of rank-\(k\) flats in a matroid with no \(U_{2, n}\)-minor
• Is the five-flow conjecture almost false?
• Matroid tree-width
• The largest real zero of the chromatic polynomial
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
• Computing Tutte Polynomials
• Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs
• Graph minors. II. Algorithmic aspects of tree-width
• Modular Constructions for Combinatorial Geometries
• COLOURING, PACKING AND THE CRITICAL PROBLEM
• A Zero-Free Interval for Chromatic Polynomials of Graphs
• The Zero-Free Intervals for Chromatic Polynomials of Graphs
• Chromatic Roots are Dense in the Whole Complex Plane

This page was built for publication: On zeros of the characteristic polynomial of matroids of bounded tree-width