相关论文: Cuts in Cartesian Products of Graphs

Let $G$ be an algebraic group, $X$ a generically free $G$-variety, and $K=k(X)^G$. A field extension $L$ of $K$ is called a splitting field of $X$ if the image of the class of $X$ under the natural map $H^1(K, G) \mapsto H^1(L, G)$ is…

We establish for the first time the explicit curvature formulas for the horizontal and vertical edges of the strong product of two regular graphs. We complement this result with showing that there does not exist an analogous formula for the…

Given a $k$-graph $\Lambda $ we construct a Markov space $M_\Lambda $, and a collection of $k$ pairwise commuting cellular automata on $M_\Lambda $, providing for a factorization of Markov's shift. Iterating these maps we obtain an action…

We extended the definition of regular dilation to graph products of $\mathbb{N}$, which is an important class of quasi-lattice ordered semigroups. Two important results in dilation theory are unified under our result: namely, Brehmer's…

If $X$ is a geodesic metric space and $x_1,x_2,x_3\in X$, a {\it geodesic triangle} $T=\{x_1,x_2,x_3\}$ is the union of the three geodesics $[x_1x_2]$, $[x_2x_3]$ and $[x_3x_1]$ in $X$. The space $X$ is $\delta$-\emph{hyperbolic} $($in the…

Explicit formulas are indicated that compute the product $z \cdot w$ of a level-one element $z \in KK^G(A,{\bf C})$ and any element $w \in KK^G({\bf C},B)$ in splitexact algebraic $KK^G$-theory, or $KK^G$-theory for $C^*$-algebras, with…

A graph $G$ is factored into graphs $H$ and $K$ via a matrix product if there exist adjacency matrices $A$, $B$, and $C$ of $G$, $H$, and $K$, respectively, such that $A = BC$. In this paper, we study the spectral aspects of the matrix…

A "clique minor" in a graph G can be thought of as a set of connected subgraphs in G that are pairwise disjoint and pairwise adjacent. The "Hadwiger number" h(G) is the maximum cardinality of a clique minor in G. This paper studies clique…

Poljak and Turz\'ik (Discrete Math. 1986) introduced the notion of \lambda-extendible properties of graphs as a generalization of the property of being bipartite. They showed that for any 0<\lambda<1 and \lambda-extendible property \Pi, any…

Convexity is a notion that has been defined for subsets of $\RR^n$ and for subsets of general graphs. A convex cut of a graph $G=(V, E)$ is a $2$-partition $V_1 \dot{\cup} V_2=V$ such that both $V_1$ and $V_2$ are convex, \ie shortest paths…

Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is the hypercube due to its structural regularity, potential…

We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…

A famous result by R\"odl, Ruci\'nski, and Szemer\'edi guarantees a (tight) Hamilton cycle in $k$-uniform hypergraphs $H$ on $n$ vertices with minimum $(k-1)$-degree $\delta_{k-1}(H)\geq (1/2+o(1))n$, thereby extending Dirac's result from…

Let $G$ be a finite group and, for a given complex character $\chi$ of $G$, let ${\mathbb{Q}}(\chi)$ denote the field extension of ${\mathbb{Q}}$ obtained by adjoining all the values $\chi(g)$, for $g\in G$. The group $G$ is called…

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

Let $U$ be a tensor product of highest weight modules of $GL_n(\mathbb C)$ corresponding to multiples of fundamental weights (i.e. rectangles). We consider three ways to stratify $U^{\otimes k}$ into components: using isotypic components of…

Let $G$ and $H$ be graphs and let $f \colon V(G)\rightarrow V(H)$ be a function. The Sierpi\'{n}ski product of $G$ and $H$ with respect to $f$, denoted by $G \otimes _f H$, is defined as the graph on the vertex set $V(G)\times V(H)$,…

We use the polynomial method of Guth and Katz to establish stronger and {\it more efficient} regularity and density theorems for such $k$-uniform hypergraphs $H=(P,E)$, where $P$ is a finite point set in ${\mathbb R}^d$, and the edge set…

We show that any dimension $6$ nearly K\"ahler (or nearly para-K\"ahler) geometry arises as a projective manifold equipped with a $\textrm{G}_2^{(*)}$ holonomy reduction. In the converse direction we show that if a projective manifold is…

A set of vertices $S$ in a simple isolate-free graph $G$ is a semi-total dominating set of $G$ if it is a dominating set of $G$ and every vertex of $S$ is within distance 2 or less with another vertex of $S$. The semi-total domination…