Related papers: A note on extremal results on directed acyclic gra…
The main purpose of this paper is to study extremal results on the intersection graphs of boxes in $\R^d$. We calculate exactly the maximal number of intersecting pairs in a family $\F$ of $n$ boxes in $\R^d$ with the property that no $k+1$…
We consider the family of undirected Cayley graphs associated with odd cyclic groups, and study statistics for the eigenvalues in their spectra. Our results are motivated by analogies between arithmetic geometry and graph theory.
In this paper extremal values of the difference between several graph invariants related to the metric dimension are studied: mixed metric dimension, edge metric dimension and strong metric dimension. These non-trivial extremal values are…
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 describe structural properties of strongly connected finite directed graphs, that are invariants of the topological conjugacy of their Markov-Dyck shifts. For strongly connected finite directed graphs with these properties topological…
Directed acyclic graphs are a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the…
For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…
The families of graphs defined by a certain type of system of equations over commutative rings have been studied and used since 1990s. This survey presents these families and their applications related to graphs, digraphs, and hypergraphs.…
We study random graph models for directed acyclic graphs, an important class of networks that includes citation networks, food webs, and feed-forward neural networks among others. We propose two specific models, roughly analogous to the…
Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…
We study directed random graphs (random graphs whose edges are directed) as they evolve in discrete time by the addition of nodes and edges. For two distinct evolution strategies, one that forces the graph to a condition of near acyclicity…
In causal inference on directed acyclic graphs, the orientation of edges is in general only recovered up to Markov equivalence classes. We study Markov equivalence classes of uniformly random directed acyclic graphs. Using a tower…
Let $G$ be a molecular graph. The total-eccentricity index of graph $G$ is defined as the sum of eccentricities of all vertices of $G$. %In [R. Farooq, M.A. Malik, J. Rada, Extremal graphs with respect to total-eccentricity index, 2017,…
Directed acyclic graphs (DAGs) are commonly used to model causal relationships among random variables. In general, learning the DAG structure is both computationally and statistically challenging. Moreover, without additional information,…
In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).
This paper is a survey on Extremal Graph Theory, primarily focusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and also describe many important results, methods, problems, and…
We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories; specifically, results for general graph…
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…
In this paper, we introduce some particular families of graphicable algebras obtained by following a relatively new line of research, initiated previously by some of the authors. It consists of the use of certain objects of Discrete…
We investigate a family of one dimensional maps for which the bifurcation diagram looks differently than the usual ones. We describe and exemplify various unique and interesting phenomena arising for this family of maps.