Results 11 to 20 of about 156 (150)
Fourientation activities and the Tutte polynomial [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A fourientation of a graph G is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it.
Spencer Backman +2 more
doaj +5 more sources
The multivariate arithmetic Tutte polynomial [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We introduce an arithmetic version of the multivariate Tutte polynomial recently studied by Sokal, and a quasi-polynomial that interpolates between the two.
Petter Brändèn, Luca Moci
doaj +7 more sources
Modifications of Tutte–Grothendieck invariants and Tutte polynomials [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Generalized Tutte–Grothendieck invariants are mappings from the class of matroids to a commutative ring that are characterized recursively by contraction–deletion rules. Well known examples are Tutte, chromatic, tension and flow polynomials.
Martin Kochol
doaj +3 more sources
A lattice point counting generalisation of the Tutte polynomial [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion- contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a matroid, and in fact
Amanda Cameron, Alex Fink
doaj +1 more source
The arithmetic Tutte polynomials of the classical root systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Many combinatorial and topological invariants of a hyperplane arrangement can be computed in terms of its Tutte polynomial. Similarly, many invariants of a hypertoric arrangement can be computed in terms of its arithmetic Tutte polynomial. We compute the
Federico Ardila +2 more
doaj +1 more source
Inapproximability of the Tutte polynomial [PDF]
Information and Computation, 2007 Minor changes to correct typos and provide clarification.
Leslie Ann Goldberg, Mark Jerrum
openaire +3 more sources
Computing Tutte Polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We present a new edge selection heuristic and vertex ordering heuristic that together enable one to compute the Tutte polynomial of much larger sparse graphs than was previously doable.
Michael Monagan
doaj +1 more source
Fourientations and the Tutte polynomial [PDF]
Research in the Mathematical Sciences, 2017 A fourientation of a graph is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it. Fixing a total order on the edges and a reference orientation of the graph, we investigate properties of cuts and cycles in fourientations which give trivariate generating functions that are generalized
Backman, Spencer, Hopkins, Sam
openaire +5 more sources
On the evaluation of the Tutte polynomial at the points (1,-1) and (2,-1) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 C. Merino [Electron. J. Combin. 15 (2008)] showed that the Tutte polynomial of a complete graph satisfies $t(K_{n+2};2,-1)=t(K_n;1,-1)$. We first give a bijective proof of this identity based on the relationship between the Tutte polynomial and the ...
Andrew Goodall +3 more
doaj +1 more source
Growing uniform planar maps face by face
Random Structures &Algorithms, Volume 63, Issue 4, Page 942-967, December 2023., 2023 Abstract We provide “growth schemes” for inductively generating uniform random 2p$$ 2p $$‐angulations of the sphere with n$$ n $$ faces, as well as uniform random simple triangulations of the sphere with 2n$$ 2n $$ faces. In the case of 2p$$ 2p $$‐angulations, we provide a way to insert a new face at a random location in a uniform 2p$$ 2p $$‐angulation
Alessandra Caraceni, Alexandre Stauffer
wiley +1 more source