Related papers: Normal binary graph models

For a graph representation of a dataset, a straightforward normality measure for a sample can be its graph degree. Considering a weighted graph, degree of a sample is the sum of the corresponding row's values in a similarity matrix. The…

We classify the pairs $(C,G)$ where $C$ is a seminormal curve over an arbitrary field $k$ and $G$ is a smooth connected algebraic group acting faithfully on $C$ with a dense orbit, and we determine the equivariant Picard group of $C$. We…

We propose a simple model for a binary decision making process on a graph, motivated by modeling social decision making with cooperative individuals. The model is similar to a random field Ising model or fiber bundle model, but with key…

We prove that every connected graph $G$ with $m$ edges contains a set $X$ of at most $\frac{3}{16}(m + 1)$ vertices such that $G-X$ has no $K_4$ minor, or equivalently, has treewidth at most $2$. This bound is best possible. Connectivity is…

A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a red/blue edge colouring of a large complete graph is asymptotically minimized by a random colouring with an equal proportion of each colour. We…

We take a fresh look at the relationship between $K$-regularity and regularity of schemes, proving two results in this direction. First, we show that $K_2$-regular affine algebras over fields of characteristic zero are normal. Second, we…

With a simple graph $G$ on $[n]$, we associate a binomial ideal $P_G$ generated by diagonal minors of an $n \times n$ matrix $X=(x_{ij})$ of variables. We show that for any graph $G$, $P_G$ is a prime complete intersection ideal and…

Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…

A graph $U$ is universal for a graph class $\mathcal{C}\ni U$, if every $G\in \mathcal{C}$ is a minor of $U$. We prove the existence or absence of universal graphs in several natural graph classes, including graphs component-wise embeddable…

We show that if $G$ is a simple triangle-free graph with $n\geq 3$ vertices, without a perfect matching, and having a minimum degree at least $\frac{n-1}{2}$, then $G$ is isomorphic either to $C_5$ or to $K_{\frac{n-1}{2},\frac{n+1}{2}}$.

We classify simple heteroclinic networks for a $\Gamma$-equivariant system in ${\mathbb R}^4$ with finite $\Gamma \subset {\rm O}(4)$, proceeding as follows: we define a graph associated with a given $\Gamma \subset {\rm O}(n)$ and identify…

Here we characterize regular and completely regular ordered semigroups by their minimal bi-ideals. A minimal bi-ideal is expressed as a product of a minimal right ideal and a minimal left ideal. Furthermore, we show that every bi-ideal in a…

In this paper, we investigate subnormal subgroups of the multiplicative group of an almost locally simple artinian algebra with involution. In particular, we show that if either the set of traces or the set of norms of such a subgroup with…

A graph $G$ is called $C_4$-free if it does not contain the cycle $C_4$ as an induced subgraph. Hubenko, Solymosi and the first author proved (answering a question of Erd\H os) a peculiar property of $C_4$-free graphs: $C_4$ graphs with $n$…

Let $H$ be a fixed graph and $\mathcal{G}$ a subcritical graph class. In this paper we show that the number of occurrences of $H$ (as a subgraph) in a uniformly at random graph of size $n$ in $\mathcal{G}$ follows a normal limiting…

We prove new lower bounds on the modularity of graphs. Specifically, the modularity of a graph $G$ with average degree $\bar d$ is $\Omega(\bar{d}^{-1/2})$, under some mild assumptions on the degree sequence of $G$. The lower bound…

A graph $G$ with four or more vertices is called bicritical if the removal of any pair of distinct vertices of $G$ results in a graph with a perfect matching. A bicritical graph is minimal if the deletion of each edge results in a…

Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…

Let $G$ be a finite simple connected graph on the vertex set $V(G)=[d]=\{1,\dots ,d\}$, with edge set $E(G)=\{e_{1},\dots , e_{n}\}$. Let $K[\mathbf{t}]=K[t_{1},\dots , t_{d}]$ be the polynomial ring in $d$ variables over a field $K$. The…

The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph.