Related papers: A note on extremal results on directed acyclic gra…
Many networks describing complex systems are directed: the interactions between elements are not symmetric. Recent work has shown that these networks can display properties such as trophic coherence or non-normality, which in turn affect…
The aim of this paper is to obtain new inequalities for a large family of generalizations of the Wiener Index and to characterize the set of extremal graphs with respect to them. Our main results provide upper and lower bounds for these…
We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…
We study families of n-gonal curves with maximal variation of moduli, which have a rational section. Certain numerical results on the degree of the modular map are obtained for such families of hyperelliptic and trigonal curves. In the last…
We provide new constructions of Meyniel extremal graphs, which are families of graphs with the conjectured largest asymptotic cop number. Using spanning subgraphs, we prove that there are an exponential number of new Meyniel extremal…
This is the second report of our work on the construction of directed strongly regular graphs. In our previous work, we constructed a couple of infinite families of new directed strongly regular graphs on the sets of antiflags of partial…
Notions of minimal sufficient causation are incorporated within the directed acyclic graph causal framework. Doing so allows for the graphical representation of sufficient causes and minimal sufficient causes on causal directed acyclic…
Directed graphs are widely used in modelling of nonsymmetric relations in various sciences and engineering disciplines. We discuss invariants of strongly connected directed graphs - minimal number of vertices or edges necessary to remove to…
Directed acyclic graphs provide a fundamental tool for representing directed dependence structures in multivariate network data, and are widely used to model financial and economic networks. However, accurate and interpretable estimation…
A long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices. The character of the problem changes in the setting of oriented graphs, and becomes more…
A descent of a labeled acyclic digraph is a directed edge $x\to y$ with $x>y$. In this paper, we find a recurrence for the number of labeled acyclic digraphs with a given number of descents.
We survey recent advances in the theory of graph and hypergraph decompositions, with a focus on extremal results involving minimum degree conditions. We also collect a number of intriguing open problems, and formulate new ones.
We study directed random graphs (random graphs whose edges are directed), and present new results on the so-called strong components of those graphs. We provide analytic and simulation results on two special classes of strong component,…
We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call "extender" and "hypershallow" graph sequences, respectively. Our main result is a probabilistic…
A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$…
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which…
Intersecting and cross-intersecting families usually appear in extremal combinatorics in the vein of the Erd{\H o}s--Ko--Rado theorem. On the other hand, P.~Erd{\H o}s and L.~Lov{\'a}sz in the noted paper~\cite{EL} posed problems on…
In multivariate statistics, acyclic mixed graphs with directed and bidirected edges are widely used for compact representation of dependence structures that can arise in the presence of hidden (i.e., latent or unobserved) variables. Indeed,…
In this work, we explore edge direction, transitivity, and connectedness of Cayley graphs of gyrogroups. More specifically, we find conditions for a Cayley graph of a gyrogroup to be undirected, transitive, and connected. We also show a…