International audienceWe discuss, on general grounds, how two subgraphs of a given Feynman graph can overlap with each other. For this, we use the notion of connecting and returning lines that describe how any subgraph is inserted within the original graph. This, in turn, allows us to derive "non-overlap" theorems for one-particle-irreducible subgraphs with $2$, $3$ and $4$ external legs. As an application, we provide a simple justification of the skeleton expansion for vertex functions with more than five legs, in the case of scalar field theories. We also discuss how the skeleton expansion can be extended to other classes of graphs
We introduce moduli spaces of colored graphs, defined as spaces of non-degenerate metrics on certain...
In this paper we reformulate the combinatorial core of construc-tive quantum field theory. We define...
This thesis is concerned about the construction of a spanning eulerian supergraph, given a subeuleri...
The purpose of this short letter is to clarify which set of pieces of Feynman graphs are resummed in...
We investigate Feynman graphs and their Feynman rules from the viewpoint of graph complexes. We focu...
The free energy of a multicomponent scalar field theory is considered as a functional W[G,J] of the ...
In this article functorial Feynman rules are introduced as large generalizations of physicists Feynm...
AbstractAs a special case of our main result, we show that for all L > 0, each k-nearest neighbor gr...
Abstract. We investigate combinatorial properties of a graph polynomial indexed by half-edges of a g...
Feynman diagrams in scalar phi-4 theory have as their underlying structure 4-regular graphs. In part...
We show that the number Z of q-edge-colourings of a simple regular graph of degree q is deducible fr...
We give a characterization of 3-connected graphs which are planar and forbid cube, octahedron, and H...
We use Reshetikhin-Turaev graphical calculus to define Feynman diagrams and prove that asymptotic ex...
Feynman integrals of quantum field theories that contain non-scalar particles go beyond the well-stu...
We show that sums over graphs such as appear in the theory of Feynman diagrams can be seen as integr...
We introduce moduli spaces of colored graphs, defined as spaces of non-degenerate metrics on certain...
In this paper we reformulate the combinatorial core of construc-tive quantum field theory. We define...
This thesis is concerned about the construction of a spanning eulerian supergraph, given a subeuleri...
The purpose of this short letter is to clarify which set of pieces of Feynman graphs are resummed in...
We investigate Feynman graphs and their Feynman rules from the viewpoint of graph complexes. We focu...
The free energy of a multicomponent scalar field theory is considered as a functional W[G,J] of the ...
In this article functorial Feynman rules are introduced as large generalizations of physicists Feynm...
AbstractAs a special case of our main result, we show that for all L > 0, each k-nearest neighbor gr...
Abstract. We investigate combinatorial properties of a graph polynomial indexed by half-edges of a g...
Feynman diagrams in scalar phi-4 theory have as their underlying structure 4-regular graphs. In part...
We show that the number Z of q-edge-colourings of a simple regular graph of degree q is deducible fr...
We give a characterization of 3-connected graphs which are planar and forbid cube, octahedron, and H...
We use Reshetikhin-Turaev graphical calculus to define Feynman diagrams and prove that asymptotic ex...
Feynman integrals of quantum field theories that contain non-scalar particles go beyond the well-stu...
We show that sums over graphs such as appear in the theory of Feynman diagrams can be seen as integr...
We introduce moduli spaces of colored graphs, defined as spaces of non-degenerate metrics on certain...
In this paper we reformulate the combinatorial core of construc-tive quantum field theory. We define...
This thesis is concerned about the construction of a spanning eulerian supergraph, given a subeuleri...