相关论文: Measure preserving homomorphisms and independent s…

We construct several pairwise-incomparable bounds on the projective dimensions of edge ideals. Our bounds use combinatorial properties of the associated graphs; in particular we draw heavily from the topic of dominating sets. Through…

One powerful method for upper-bounding the largest independent set in a graph is the Hoffman bound, which gives an upper bound on the largest independent set of a graph in terms of its eigenvalues. It is easily seen that the Hoffman bound…

Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…

We show that every homeomorphism between closed measure zero subsets extends to a measure preserving auto-homeomorphism, whenever the Cantor set is endowed with a suitable probability measure. This is valid both for the standard product…

The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that,…

We introduce the notions of over- and under-independence for weakly mixing and (free) ergodic measure preserving actions and establish new results which complement and extend the theorems obtained in [BoFW] and [A]. Here is a sample of…

We study tensor powers of representations of finite monoids, focusing on the growth behavior of their composition length and the number of indecomposable summands. Special attention is given to diagram monoids such as the Temperley-Lieb,…

The size of a largest independent set of vertices in a given graph $G$ is denoted by $\alpha(G)$ and is called its independence number (or stability number). Given a graph $G$ and an integer $K,$ it is NP-complete to decide whether…

We consider numbers and sizes of independent sets in graphs with minimum degree at least $d$, when the number $n$ of vertices is large. In particular we investigate which of these graphs yield the maximum numbers of independent sets of…

We examine the Maximum Independent Set Problem in an undirected graph. The main result is that this problem can be considered as the solving the same problem in a subclass of the weighted normal twin-orthogonal graphs. The problem is…

We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the…

Computing the maximum size of an independent set in a graph is a famously hard combinatorial problem that has been well-studied for various classes of graphs. When it comes to random graphs, only the classical Erd\H{o}s-R\'enyi-Gilbert…

We study linear maps preserving the higher numerical ranges of tensor product of matrices.

Extremal problems involving independent sets are much studied. Two of the most important extremal problems in this context are concerned with the sharp upper bounds for the number of independent sets of fixed size and the independence…

We provide an upper bound to the number of graph homomorphisms from $G$ to $H$, where $H$ is a fixed graph with certain properties, and $G$ varies over all $N$-vertex, $d$-regular graphs. This result generalizes a recently resolved…

The tensor network variety is a variety of tensors associated to a graph and a set of positive integer weights on its edges, called bond dimensions. We determine an upper bound on the dimension of the tensor network variety. A refined upper…

In this paper, we propose a perturbation framework to measure the robustness of graph properties. Although there are already perturbation methods proposed to tackle this problem, they are limited by the fact that the strength of the…

We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these…