相关论文: Graphs and $({\Bbb Z}_2)^k$-actions

Let $k \ge 3$ be a fixed integer. We exactly determine the asymptotic distribution of $\ln Z_k(G(n,m))$, where $Z_k(G(n,m))$ is the number of $k$-colourings of the random graph $G(n,m)$. A crucial observation to this aim is that the…

A graph $G$ has maximal local edge-connectivity $k$ if the maximum number of edge-disjoint paths between every pair of distinct vertices $x$ and $y$ is at most $k$. We prove Brooks-type theorems for $k$-connected graphs with maximal local…

We prove that for each integer k of at least 2, there is an open neigborhood \nu_k of the identity map of the 2-sphere S^2, in C^1-topology such that: if G is a nilpotent subgroup of Diff^1(S^2) with length k of nilpotency, generated by…

Given a sequence $\mathbf{k} := (k_1,\ldots,k_s)$ of natural numbers and a graph $G$, let $F(G;\mathbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\dots,s$ such that, for every $c \in \{1,\dots,s\}$, the edges…

We work with simple graphs in ZF (Zermelo--Fraenkel set theory without the Axiom of Choice (AC)) and assume that the sets of colors can be either well-orderable or non-well-orderable to prove that the following statements are equivalent to…

We construct metrics of positive scalar curvature on manifolds with circle actions. One of our main results is that there exist $S^1$-invariant metrics of positive scalar curvature on every $S^1$-manifold which has a fixed point component…

We prove that the number of multigraphs with vertex set $\{1, \ldots, n\}$ such that every four vertices span at most nine edges is $a^{n^2 + o(n^2)}$ where $a$ is transcendental (assuming Schanuel's conjecture from number theory). This is…

We give a new proof of Cartan's fixed point theorem using topological fixed point theory. For an odd dimensional, simply connected and complete manifold having non-positive curvature, we further prove that every isometry with finite order…

A graph $G$ is $k$-critical if it has chromatic number $k$, but every proper subgraph of $G$ is $(k-1)$--colorable. Let $f_k(n)$ denote the minimum number of edges in an $n$-vertex $k$-critical graph. We give a lower bound, $f_k(n) \geq…

Let G be a group and let M be a CAT(0) proper metric space (e.g. a simply connected complete Riemannian manifold of non-positive sectional curvature or a locally finite tree). Isometric actions of G on M are (by definition) points in the…

For every compact almost complex manifold (M,J) equipped with a J-preserving circle action with isolated fixed points, a simple algebraic identity involving the first Chern class is derived. This enables us to construct an algorithm to…

Let $\mathbf{k} := (k_1,\dots,k_s)$ be a sequence of natural numbers. For a graph $G$, let $F(G;\mathbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\dots,s$ such that, for every $c \in \{1,\dots,s\}$, the edges…

Motivated by the increasing need for fast processing of large-scale graphs, we study a number of fundamental graph problems in a message-passing model for distributed computing, called $k$-machine model, where we have $k$ machines that…

Let $G$ be a compact group, let $\mathcal{B}$ be a unital C$^*$-algebra, and let $(\mathcal{A},G,\alpha)$ be a free C$^*$-dynamical system, in the sense of Ellwood, with fixed point algebra $\mathcal{B}$. We prove that…

In this paper, we are interested in the number of fixed points of functions $f:A^n\to A^n$ over a finite alphabet $A$ defined on a given signed digraph $D$. We first use techniques from network coding to derive some lower bounds on the…

Let $G=(V,E)$ be a complete $n$-vertex graph with distinct positive edge weights. We prove that for $k\in\{1,2,...,n-1\}$, the set consisting of the edges of all minimum spanning trees (MSTs) over induced subgraphs of $G$ with $n-k+1$…

Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the…

This paper develops techniques which are used to answer a number of questions in the theory of equivalence relations generated by continuous actions of abelian groups. The methods center around the construction of certain specialized…

We examine $t$-colourings of oriented graphs in which, for a fixed integer $k \geq 1$, vertices joined by a directed path of length at most $k$ must be assigned different colours. A homomorphism model that extends the ideas of Sherk for the…

The classical stability theorem of Erd\H{o}s and Simonovits states that, for any fixed graph with chromatic number $k+1 \ge 3$, the following holds: every $n$-vertex graph that is $H$-free and has within $o(n^2)$ of the maximal possible…