• Corpus ID: 239009656

A degree preserving delta wye transformation with applications to 6-regular graphs and Feynman periods

  title={A degree preserving delta wye transformation with applications to 6-regular graphs and Feynman periods},
  author={Shannon N. Jeffries and Karen A. Yeats},
We investigate a degree preserving variant of the ∆-Y transformation which replaces a triangle with a new 6-valent vertex which has double edges to the vertices that had been in the triangle. This operation is relevant for understanding scalar Feynman integrals in 6 dimensions. We study the structure of equivalence classes under this operation and its inverse, with particular attention to when the equivalence classes are finite, when they contain simple 6-regular graphs, and when they contain… 


A note on delta-wye-delta reductions of plane graphs
A connected plane graph G with two distinguished vertices can be reduced to a single edge between these two vertices using certain local transformations, including series/parallel reductions and
More Forbidden Minors for Wye-Delta-Wye Reducibility
  • Yaming Yu
  • Mathematics, Computer Science
    Electron. J. Comb.
  • 2006
A characterization of such forbidden minors that can be written as clique $k-sums for $k=1, 2, 3$ is obtained.
Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
This paper shows that four-terminal planar graphs are Y Y-reducible when at least three of the vertices lie on the same face, and considers terminals in projective-planar graphs.
An algorithm for delta-wye reduction of almost-planar graphs
It is proved that simple, 3-connected, almost-planar graphs have crossing number one and furthermore that these graphs are 3-terminal delta–wye reducible to K 6 minus the edges of a triangle, whose vertices are taken as terminals.
Matroids motives, and a conjecture of Kontsevich
Let G be a finite connected graph. The Kirchhoff polynomial of G is a certain homogeneous polynomial whose degree is equal to the first betti number of G. These polynomials appear in the study of
On the delta-wye reduction for planar graphs
  • K. Truemper
  • Mathematics, Computer Science
    J. Graph Theory
  • 1989
We provide an elementary proof of an important theorem by G. V. Epifanov, according to which every two-terminal planar graph satisfying certain connectivity restrictions can by some sequence of
Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs
A simple, O(|V|2) time algorithm is presented that reduces a connected two-terminal, undirected, planar graph to a single edge, by way of series and parallel reductions and delta-wye transformations.
Graphical functions and single-valued multiple polylogarithms
Graphical functions are single-valued complex functions which arise from Feynman amplitudes. We study their properties and use their connection to multiple polylogarithms to calculate Feynman
For a set of five edges, a graph splits if one of the associated Dodgson polynomials is equal to zero. A graph G splitting for every set of five edges is a minor-closed property. As such there is a
Onsager’s Star-Triangle Equation: Master Key to Integrability
Abstract After a brief review of the history of the star-triangle equation, we shall illustrate its importance with a few results for the two-dimensional Ising model and its generalization to the