相关论文: k --Universal Finite Graphs

Given a row-finite $k$-graph $\Lambda$ with no sources we investigate the $K$-theory of the higher rank graph $C^*$-algebra, $C^*(\Lambda)$. When $k=2$ we are able to give explicit formulae to calculate the $K$-groups of $C^*(\Lambda)$. The…

Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…

In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…

Noncommutative lattices have been recently used as finite topological approximations in quantum physical models. As a first step in the construction of bundles and characteristic classes over such noncommutative spaces, we shall study their…

Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. Let $P_t$ be the path on $t$ vertices. A graph $G$ is $k$-vertex-critical if $G$ has chromatic number $k$ but…

A finite group $G$ is said to be rational if every character of $G$ is rational-valued. The Gruenberg-Kegel graph of a finite group $G$ is the undirected graph whose vertices are the primes dividing the order of $G$ and the edges join…

K-theory and Ext are computed for the C*-algebra C*(E) of any countable directed graph E. The results generalize the K-theory computations of Raeburn and Szymanski and the Ext computations of Tomforde for row-finite graphs. As a…

We consider the bimodal language, where the first modality is interpreted by a binary relation in the standard way, and the second is interpreted by the relation of inequality. It follows from Hughes (1990), that in this language,…

We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.

Let $C^*(E)$ be the graph $C^*$-algebra associated to a graph E and let J be a gauge invariant ideal in $C^*(E)$. We compute the cyclic six-term exact sequence in $K$-theory of the associated extension in terms of the adjacency matrix…

This paper lays out the foundations of graded $K$-theory for Leavitt algebras associated with higher-rank graphs, also known as Kumjian-Pask algebras, establishing it as a potential tool for their classification. For a row-finite $k$-graph…

We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…

A triangle-free graph G is called k-existentially complete if for every induced k-vertex subgraph H of G, every extension of H to a (k+1)-vertex triangle-free graph can be realized by adding another vertex of G to H. Cherlin asked whether…

The $k$-dominating graph $D_k(G)$ of a graph $G$ is defined on the vertex set consisting of dominating sets of $G$ with cardinality at most $k$, two such sets being adjacent if they differ by either adding or deleting a single vertex. A…

Let $G$ be a graph with vertex set $V(G)$. Let $n$ and $k$ be non-negative integers such that $n + 2k \leq |V(G)| - 2$ and $|V(G)| - n$ is even. If when deleting any $n$ vertices of $G$ the remaining subgraph contains a matching of $k$…

A $k$-graph $\mathcal{G}$ is asymmetric if there does not exist an automorphism on $\mathcal{G}$ other than the identity, and $\mathcal{G}$ is called minimal asymmetric if it is asymmetric but every non-trivial induced sub-hypergraph of…

Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos…

For a simple graph $F$, let $\mathrm{EX}(n, F)$ and $\mathrm{EX_{sp}}(n,F)$ be the set of graphs with the maximum number of edges and the set of graphs with the maximum spectral radius in an $n$-vertex graph without any copy of the graph…

The Farrell-Jones Fibered Isomorphism Conjecture for the stable topological pseudoisotopy theory has been proved for several classes of groups. For example for discrete subgroups of Lie groups, virtually poly-infinite cyclic groups, Artin…

We introduce the family of $k$-gap-planar graphs for $k \geq 0$, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most $k$ of its crossings. This definition is…