2.2k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR1.4k papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR1.3k papers
- Université Paris-SudFR999 papers
- Institute for High Energy PhysicsES979 papers
- Petersburg Nuclear Physics InstituteRU978 papers
- Laboratoire de Physique de Clermont AuvergneFR937 papers
- National Institute for Subatomic PhysicsNL919 papers
- Institute for Theoretical and Experimental PhysicsRU876 papers
- Centre de physique des particules de MarseilleFR824 papers
- Aix-Marseille UniversitéFR794 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR773 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di Roma IIT764 papers
16 papers · 1 filter
Homomorphism bounds and edge-colourings of -minor-free graphs
Laurent Beaudou, Florent Foucaud, Reza Naserasr
We present a necessary and sufficient condition for a graph of odd-girth to bound the class of -minor-free graphs of odd-girth (at least) , that is, to admit a ho…
Location-domination in line graphs
Florent Foucaud, Michael A. Henning
A set of vertices of a graph is locating if every two distinct vertices outside have distinct neighbors in ; that is, for distinct vertices and outside ,…
Location-domination and matching in cubic graphs
Florent Foucaud, Michael A. Henning
A dominating set of a graph is a set of vertices of such that every vertex outside is adjacent to a vertex in . A locating-dominating set of is a dominating…
Locating-dominating sets in twin-free graphs
Florent Foucaud, Michael A. Henning, Christian Löwenstein +1
A locating-dominating set of a graph is a dominating set of with the additional property that every two distinct vertices outside have distinct neighbors in ; th…
Locating-dominating sets and identifying codes in graphs of girth at least 5
Camino Balbuena, Florent Foucaud, Adriana Hansberg
Locating-dominating sets and identifying codes are two closely related notions in the area of separating systems. Roughly speaking, they consist in a dominating set of a graph such…
Noncommutative Bell polynomials, quasideterminants and incidence Hopf algebras
Kurusch Ebrahimi-Fard, Alexander Lundervold, Dominique Manchon
Bell polynomials appear in several combinatorial constructions throughout mathematics. Perhaps most naturally in the combinatorics of set partitions, but also when studying composi…
Random subgraphs make identification affordable
Florent Foucaud, Guillem Perarnau, Oriol Serra
An identifying code of a graph is a dominating set which uniquely determines all the vertices by their neighborhood within the code. Whereas graphs with large minimum degree have s…
The Magnus expansion, trees and Knuth's rotation correspondence
Kurusch Ebrahimi-Fard, Dominique Manchon
W. Magnus introduced a particular differential equation characterizing the logarithm of the solution of linear initial value problems for linear operators. The recursive solution o…
On an extension of Knuth's rotation correspondence to reduced planar trees
Kurusch Ebrahimi-Fard, Dominique Manchon
We present a bijection from planar reduced trees to planar rooted hypertrees, which extends Knuth's rotation correspondence between planar binary trees and planar rooted trees. The…
Lines in hypergraphs
Laurent Beaudou, Adrian Bondy, Xiaomin Chen +5
One of the De Bruijn - Erdos theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a…
Well-Quasi-Ordering of Matrices under Schur Complement and Applications to Directed Graphs
Mamadou Moustapha Kanté
In [Rank-Width and Well-Quasi-Ordering of Skew-Symmetric or Symmetric Matrices, arXiv:1007.3807v1] Oum proved that, for a fixed finite field , any infinite sequence $M_…
Twisted dendriform algebras and the pre-Lie Magnus expansion
Kurusch Ebrahimi-Fard, Dominique Manchon
In this paper an application of the recently introduced pre-Lie Magnus expansion to Jackson's q-integral and q-exponentials is presented. Twisted dendriform algebras, which are the…
Dendriform Equations
Kurusch Ebrahimi-Fard, Dominique Manchon
We investigate solutions for a particular class of linear equations in dendriform algebras. Motivations as well as several applications are provided. The latter follow naturally fr…
Two interacting Hopf algebras of trees
Damien Calaque, Kurusch Ebrahimi-Fard, Dominique Manchon
Hopf algebra structures on rooted trees are by now a well-studied object, especially in the context of combinatorics. In this work we consider a Hopf algebra H by introducing a cop…
New identities in dendriform algebras
Kurusch Ebrahimi-Fard, Dominique Manchon, Frédéric Patras
Dendriform structures arise naturally in algebraic combinatorics (where they allow, for example, the splitting of the shuffle product into two pieces) and through Rota-Baxter algeb…
A noncommutative Bohnenblust-Spitzer identity for Rota-Baxter algebras solves Bogoliubov's recursion
Kurusch Ebrahimi-Fard, Dominique Manchon, Frederic Patras
The Bogoliubov recursion is a particular procedure appearing in the process of renormalization in perturbative quantum field theory. It provides convergent expressions for otherwis…