Results 61 to 70 of about 156 (150)

Ehrhart polynomial and arithmetic Tutte polynomial

open access: yesEuropean Journal of Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michele D'Adderio, Luca Moci
openaire   +7 more sources

Crossing estimates for the Ising model on general s‐embeddings

open access: yesProceedings of the London Mathematical Society, Volume 131, Issue 4, October 2025.
Abstract We prove Russo–Seymour–Welsh‐type crossing estimates for the FK–Ising model on general s‐embeddings whose origami map has an asymptotic Lipschitz constant strictly smaller than 1, provided it satisfies a mild non‐degeneracy assumption. This result extends the work of Chelkak and provides a general framework to prove that the usual connection ...
Rémy Mahfouf
wiley   +1 more source

A Sharper Ramsey Theorem for Constrained Drawings

open access: yesJournal of Graph Theory, Volume 109, Issue 4, Page 401-411, August 2025.
ABSTRACT Given a graph G and a collection C of subsets of R d indexed by the subsets of vertices of G, a constrained drawing of G is a drawing where each edge is drawn inside some set from C, in such a way that nonadjacent edges are drawn in sets with disjoint indices. In this paper we prove a Ramsey‐type result for such drawings.
Pavel Paták
wiley   +1 more source

Tutte Polynomials and Graph Symmetries

open access: yesSymmetry, 2022
The Tutte polynomial is an isomorphism invariant of graphs that generalizes the chromatic and the flow polynomials. This two-variable polynomial with integral coefficients is known to carry important information about the properties of the graph. It has been used to prove long-standing conjectures in knot theory. Furthermore, it is related to the Potts
Nafaa Chbili   +3 more
openaire   +1 more source

Exact Expectation and Variance of Minimal Basis of Random Matroids

open access: yesDiscussiones Mathematicae Graph Theory, 2013
We formulate and prove a formula to compute the expected value of the minimal random basis of an arbitrary finite matroid whose elements are assigned weights which are independent and uniformly distributed on the interval [0, 1].
Kordecki Wojciech   +1 more
doaj   +1 more source

Basilica: New canonical decomposition in matching theory

open access: yesJournal of Graph Theory, Volume 108, Issue 3, Page 508-542, March 2025.
Abstract In matching theory, one of the most fundamental and classical branches of combinatorics, canonical decompositions of graphs are powerful and versatile tools that form the basis of this theory. However, the abilities of the known canonical decompositions, that is, the Dulmage–Mendelsohn, Kotzig–Lovász, and Gallai–Edmonds decompositions, are ...
Nanao Kita
wiley   +1 more source

A Convolution Formula for the Tutte Polynomial

open access: yesJournal of Combinatorial Theory, Series B, 1999
6 ...
Woong Kook   +2 more
openaire   +3 more sources

Dirac traces and the Tutte polynomial

open access: yesJournal of High Energy Physics
Perturbative calculations involving fermion loops in quantum field theories require tracing over Dirac matrices. A simple way to regulate the divergences that generically appear in these calculations is dimensional regularisation, which has the ...
Joshua Lin
doaj   +1 more source

From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
The algorithm of Tutte for constructing convex planar straight-line drawings and the algorithm of Floater and Gotsman for constructing planar straight-line morphs are among the most popular graph drawing algorithms.
Giuseppe Di Battista, Fabrizio Frati
doaj   +1 more source

On finite generation in magnitude (co)homology and its torsion

open access: yesBulletin of the London Mathematical Society, Volume 56, Issue 11, Page 3434-3451, November 2024.
Abstract The aim of this paper is to apply the framework developed by Sam and Snowden to study structural properties of graph homologies, in the spirit of Ramos, Miyata and Proudfoot. Our main results concern the magnitude homology of graphs introduced by Hepworth and Willerton, and we prove that it is a finitely generated functor (on graphs of bounded
Luigi Caputi, Carlo Collari
wiley   +1 more source

Home - About - Disclaimer - Privacy