Related papers: A K\"{u}nneth Formula of Hypergraphs

In this paper, we study multiplicative structures on the K-theory of the core $A:=C^*(E)^{U(1)}$ of the C*-algebra $C^*(E)$ of a directed graph $E$. In the first part of the paper, we study embeddings $E\to E\times E$ that induce a…

In this paper, we consider homological properties of so-called graph ideals. Consider $\Gamma$ is a graph with vertices $t_1$, ..., $t_s$, without self-loops and multiple adjacencies. We can associate with such a graph an ideal…

A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…

We identify the cohomology of the stable classifying space of homotopy automorphisms (relative to an embedded disk) of connected sums of $S^k \times S^l$, where $3 \le k < l \le 2k - 2$. The result is expressed in terms of Lie graph complex…

In this paper we establish a direct connection between stable approximate unitary equivalence for $*$-homomorphisms and the topology of the KK-groups which avoids entirely C*-algebra extension theory and does not require nuclearity…

We give an infinite dimensional description of the differential K-theory of a manifold $M$. The generators are triples $[H, A, \omega]$ where $H$ is a ${\bf Z}_2$-graded Hilbert bundle on $M$, $A$ is a superconnection on $H$ and $\omega$ is…

We establish an area formula for the spherical measure of intrinsic graphs of any codimension in homogeneous groups. Our approach relies on the assumption that the map defining the intrinsic graph is continuously intrinsically…

A $k$-uniform hypergraph $M$ is set-homogeneous if it is countable (possibly finite) and whenever two finite induced subhypergraphs $U,V$ are isomorphic there is $g\in Aut(M)$ with $U^g=V$; the hypergraph $M$ is said to be homogeneous if in…

Index maps taking values in the $K$-theory of a mapping cone are defined and discussed. The resulting index theorem can be viewed in analogy with the Freed-Melrose index theorem. The framework of geometric $K$-homology is used in a…

Inspired by a famous characterization of perfect graphs due to Lov\'{a}sz, we define a graph $G$ to be sum-perfect if for every induced subgraph $H$ of $G$, $\alpha(H) + \omega(H) \geq |V(H)|$. (Here $\alpha$ and $\omega$ denote the…

We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding…

We define for every dendroidal set X a chain complex and show that this assignment determines a left Quillen functor. Then we define the homology groups $H_n(X)$ as the homology groups of this chain complex. This generalizes the homology of…

We construct and analyze an explicit basis for the homology of the boolean complex of a Coxeter system. This gives combinatorial meaning to the spheres in the wedge sum describing the homotopy type of the complex. We assign a set of…

We study K-theory classes of Hamiltonian loop group spaces represented by admissible Fredholm complexes. We prove various equivariant index formulae in this context. In a sequel to this article we show that, when specialized to a family of…

In this paper we consider the problem to reconstruct a $k$-uniform hypergraph from its line graph. In general this problem is hard. We solve this problem when the number of hyperedges containing any pair of vertices is bounded. Given an…

Graph encoder embedding, a recent technique for graph data, offers speed and scalability in producing vertex-level representations from binary graphs. In this paper, we extend the applicability of this method to a general graph model, which…

We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…

We study the problem of finding a copy of a specific induced subgraph on inhomogeneous random graphs with infinite variance power-law degrees. We provide a fast algorithm that finds a copy of any connected graph $H$ on a fixed number of $k$…

Let X(G) denote the flag complex of a graph G=(V,E) on n vertices. We study relations between the first eigenvalues of successive higher Laplacians of X(G). One consequence is the following result: Let \lambda_2(G) denote the second…

We determine for which $m$, the complete graph $K_m$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.