Irreducibility of the Tutte polynomial of a connected matroid

DOI10.1006/jctb.2001.2058zbMath1028.05023OpenAlexW2015987344MaRDI QIDQ1850570

Marc Noy, Anna de Mier, Criel Merino

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/fd53081b0e5e9d489ac0f2a67afb2268a73bfd48

zbMATH Keywords

conjecture of Brylawski

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Combinatorial aspects of matroids and geometric lattices (05B35) Lattices of subspaces and geometric closure systems (51D25)

Related Items (15)

Chromatic zeros on hierarchical lattices and equidistribution on parameter space ⋮ Graphs determined by polynomial invariants ⋮ Schubert matroids, Delannoy paths, and Speyer's invariant ⋮ Recursively constructible families of graphs ⋮ The \(\mathcal{G}\)-invariant and catenary data of a matroid ⋮ Algebraic properties of chromatic roots ⋮ Galois groups of multivariate Tutte polynomials ⋮ The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma ⋮ Unnamed Item ⋮ Thomas H. Brylawski (1944--2007) ⋮ The Tutte Polynomial Characterizes Simple Outerplanar Graphs ⋮ Factorisation of greedoid polynomials of rooted digraphs ⋮ On matroids determined by their Tutte polynomials ⋮ Linear relations for a generalized Tutte polynomial ⋮ Irreducibility of the Tutte polynomial of an embedded graph

Cites Work

• A Decomposition for Combinatorial Geometries
• Unnamed Item
• Unnamed Item

This page was built for publication: Irreducibility of the Tutte polynomial of a connected matroid