Related papers: Algebras, graphs and thetas
The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…
Let $\Gamma(n,k)$ be the set of $2$-connected $n$-vertex graphs containing an edge that is not on any cycle of length at least $k+1.$ Let $g_s(n,k)$ denote the maximum number of $s$-cliques in a graph in $\Gamma(n,k).$ Recently, Ji and Ye…
Graph homomorphism has been an important research topic since its introduction [17]. Stated in the language of binary relational structures in that paper [17], Lov\'asz proved a fundamental theorem that, for a graph $H$ given by its $0$-$1$…
We establish a threshold for the connectivity of certain random graphs whose (dependent) edges are determined by the uniform distributions on generalized Orlicz balls, crucially using their negative correlation properties. We also show the…
Complex unit gain graphs may exhibit various kinds of symmetry. In this work, we explore structural symmetry, spectral symmetry and sign-symmetry in such graphs, and their respective relations to one-another. Our main result is a…
In two seminal papers M. Kontsevich introduced graph homology as a tool to compute the homology of three infinite dimensional Lie algebras, associated to the three operads `commutative,' `associative' and `Lie.' We generalize his theorem to…
We introduce a zeta function of digraphs that determines, and is determined by, the spectra of all linear combinations of the adjacency matrix, its transpose, the out-degree matrix, and the in-degree matrix. In particular, zeta-equivalence…
We formalize eight different notions of isomorphism among (unital) graph C*-algebras, and initiate the study of which of these notions may be described geometrically as generated by moves. We propose a list of seven types of moves that we…
Classical algebraic structures require exact satisfaction of their defining axioms. We propose similarity algebra, a framework extending algebraic and Lie structures to settings where operations satisfy quantitative bounds up to a tolerance…
Given a graph $G$ and a constant $\gamma \in [0,1]$, let $\omega^{(\gamma)}(G)$ be the largest integer $r$ such that there exists an $r$-vertex subgraph of $G$ containing at least $\gamma \binom{r}{2}$ edges. It was recently shown that…
We study the relation between algebraic structures and Graph Theory. We have defined five different weighted digraphs associated to a finite dimensional algebra over a field in order to tackle important properties of the associated…
We study generalizations of the "contraction-deletion" relation of the Tutte polynomial, and other similar simple operations, to other graph parameters. The question can be set in the framework of graph algebras introduced by Freedman,…
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…
For an arbitrary countable directed graph E we show that the only possible values of the stable rank of the associated Cuntz-Krieger algebra C*(E) are 1, 2 or \infty. Explicit criteria for each of these three cases are given. We…
A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, respectively, in the same direction. Opposition and coalition…
We introduce a notion of a girth-regular graph as a $k$-regular graph for which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called the signature) giving, for every vertex $u$ of the graph, the number of girth cycles the…
We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their…
We study how many copies of a graph $F$ that another graph $G$ with a given number of cliques is guaranteed to have. For example, one of our main results states that for all $t\ge 2$, if $G$ is an $n$ vertex graph with $kn^{3/2}$ triangles…
We show that the discrete versions of the systolic inequality that estimate the number of vertices of a simplicial complex from below have substantial applications to graphs, the one-dimensional simplicial complexes. Almost directly they…
Mubayi and Verstraete conjectured that if $T$ is a tree on $t + 1$ vertices, then any $n$-vertex graph $G$ with average degree $d$ contains at least \[ n d(d - 1) \cdots (d - t + 1) \] labeled copies of $T$ as long as $d$ is sufficiently…