Related papers: A note on directed analogues of the Sidorenko and …
We construct a simple acyclic directed graph for which the Bunkbed Conjecture is false, thereby resolving conjectures posed by Leander and by Hollom.
In this note we propose an $\omega$-operadical way to prove the existence of the $\omega$-graph of the $\omega$-graphs and the reflexive $\omega$- graph of the reflexive $\omega$-graphs.
We explore pseudometrics for directed graphs in order to better understand their topological properties. The directed flag complex associated to a directed graph provides a useful bridge between network science and topology. Indeed, it has…
We introduce priors and algorithms to perform Bayesian inference in Gaussian models defined by acyclic directed mixed graphs. Such a class of graphs, composed of directed and bi-directed edges, is a representation of conditional…
We develop a Glivenko--Cantelli theory for monotone, almost additive functions of i.\,i.\,d.\ sequences of random variables indexed by~$\Z^d$. Under certain conditions on the random sequence, short range correlations are allowed as well. We…
This is a survey of recently published results. We introduce and study a wide class algebras associated to directed graphs and related to factorizations of noncommutative polynomials. In particular, we show that for many well-known graphs…
We show that contracting self-similar groups satisfy the Farrell-Jones conjectures as soon as their universal contracting cover is non-positively curved. This applies in particular to bounded self-similar groups. We define, along the way, a…
In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of…
We consider various regular graphs defined on the set of elements of given rank of a finite polar space. It is likely that no two such graphs, of the same kind but defined for different ranks, can have the same degree. We shall prove this…
Transit functions were introduced as models of betweenness on undirected structures. Here we introduce directed transit function as the directed analogue on directed structures such as posets and directed graphs. We first show that…
The family of Directed Acyclic Graphs as well as some related graphs are analyzed with respect to extremal behavior in relation with the family of intersection graphs for families of boxes with transverse intersection.
It is known that given a directed graph E and a subset X of vertices, the sum of the projections associated to the vertices in X in the C*-algebra of E converges strictly in the multiplier algebra to a projection P. Here we give a…
We consider two recent conjectures of Harrington, Henninger-Voss, Karhadkar, Robinson and Wong concerning relationships between the sum index, difference index and exclusive sum number of graphs. One conjecture posits an exact relationship…
Solutions to the Markov equation appear in many mathematical contexts. We aim to build on the understanding of them by proving a recent conjecture about Markov polynomials; solutions to a generalised version of the Markov equation. The…
An undirected graph $G$ is said to admit an antimagic orientation if there exist an orientation $D$ and a bijection between $E(G)$ and $\{1,2,\ldots,|E(G)|\}$ such that any two vertices have distinct vertex sums, where the vertex sum of a…
We build a continuous analogue for Young diagrams, thought of as left-aligned stairs, following the line of research initiated by D\'iaz and Cano on the construction of continuous analogues for combinatorial objects.
We show that for any natural number $k \ge 1$, any oriented graph $D$ of minimum semidegree at least $(3k- 2)/4$ contains an antidirected path of length $k$. In fact, a slightly weaker condition on the semidegree sequence of $D$ suffices,…
In Part I of this work we defined a generalization of the concept of effective resistance to directed graphs, and we explored some of the properties of this new definition. Here, we use the theory developed in Part I to compute effective…
In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce a set of logical connectives allowing us to extend the correspondence between cographs and classical propositional formulas to any…
In this brief note I try to give a simple example of where physical intuition about a collection of interacting qubits can lead to the construction of "natural" versions of what are, generically, quite abstract mathematical objects - in…