Related papers: Normal binary graph models

Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…

The objective of this article is to give an effective algebraic characterization of normal crossing hypersurfaces in complex manifolds. It is shown that a hypersurface has normal crossings if and only if it is a free divisor, has a radical…

The basis number of a graph $G$ is the minimum $k$ such that the cycle space of $G$ is generated by a family of cycles using each edge at most $k$ times. A classical result of Mac Lane states that planar graphs are exactly graphs with basis…

Let $N \subset M$ be an irreducible inclusion of type type II$_1$ factors with finite Jones index. We shall introduce the notion of normality for intermediate subfactors of the inclusion $N \subset M$. If the depth of $N \subset M$ is 2,…

In 1999, De Simone and K\"{o}rner conjectured that every graph without induced $C_5,C_7,\overline{C}_7$ contains a clique cover $\mathcal C$ and a stable set cover $\mathcal I$ such that every clique in $\mathcal C$ and every stable set in…

Suppose that M is countable, binary, primitive, homogeneous, and simple, and hence 1-based. We prove that the SU-rank of the complete theory of M is~1. It follows that M is a random structure. The conclusion that M is a random structure…

A graph $G$ is said to be $1$-perfectly orientable if it has an orientation such that for every vertex $v\in V(G)$, the out-neighborhood of $v$ in $D$ is a clique in $G$. In $1982$, Skrien posed the problem of characterizing the class of…

In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…

In this paper we give structural characterizations of graphs not containing rooted $K_{4}$, $W_{4}$, $K_{2,4}$, and a graph we call $L$.

It is known that every semigroup of normal completely positive maps of a von Neumann can be ``dilated" in a particular way to an E_0-semigroup acting on a larger von Neumann algebra. The E_0-semigroup is not uniquely determined by the…

A graph G is called "minimalizable" if a diagram with minimal crossing number can be obtained from an arbitrary diagram of G by crossing changes. If, furthermore, the minimal diagram is unique up to crossing changes then G is called…

We prove that every locally finite quasi-transitive graph that does not contain $K_\infty$ as a minor is quasi-isometric to some planar quasi-transitive locally finite graph. This solves a problem of Esperet and Giocanti and improves their…

Let $\pi_1(C)$ be the algebraic fundamental group of a smooth connected affine curve, defined over an algebraically closed field of characteristic $p>0$ of countable cardinality. Let $N$ be a normal (resp. characteristic) subgroup of…

We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index $\ge 5$. In order to have the necessity part, graphs are organized into small classes so that one of homological…

We examine two natural operations to create numerical semigroups. We say that a numerical semigroup $\mathcal{S}$ is $k$-normalescent if it is the projection of the set of integer points in a $k$-dimensional polyhedral cone, and we say that…

In this paper we prove the following Liouville-type theorem: any anisotropic minimal graph with free boundary in the half-space must be flat, provided that the graph function has at most one-sided linear growth. This extends the classical…

For an integer $n\geq 2$, the triangular graph has vertex set the $2$-subsets of $\{1,\ldots,n\}$ and edge set the pairs of $2$-subsets intersecting at one point. Such graphs are known to be halved graphs of bipartite rectagraphs, which are…

We introduce four new elementary short proofs of the famous K\"onig's theorem which characterizes bipartite graphs by absence of odd cycles.

Chung, Graham, and Wilson proved that a graph is quasirandom if and only if there is a large gap between its first and second largest eigenvalue. Recently, the authors extended this characterization to k-uniform hypergraphs, but only for…

A graph is a cograph if it is $P_4$-free. A $k$-polar partition of a graph $G$ is a partition of the set of vertices of $G$ into parts $A$ and $B$ such that the subgraph induced by $A$ is a complete multipartite graph with at most $k$…