Related papers: Quillen model structures on the category of graphs
We demonstrate that the proper homotopy equivalence relation for locally finite graphs is Borel complete. Furthermore, among the infinite graphs, there is a comeager equivalence class. As corollaries, we obtain the analogous results for the…
We recall several categories of graphs which are useful for describing homotopy-coherent versions of generalized operads (e.g. cyclic operads, modular operads, properads, and so on), and give new, uniform definitions for their morphisms.…
We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.
We consider the homotopy type of maps between symplectic surface whose graphs form symplectic submanifolds of the product. We give a purely topological model for this space in terms of maps with constrained numbers of pre-images. We use…
For a small category A, we prove that the homotopy colimit functor from the category of simplicial diagrams on A to the category of simplicial sets over the nerve of A establishes a left Quillen equivalence between the projective (or Reedy)…
We construct a discrete model of the homotopy theory of $S^1$-spaces. We define a category $\sP$ with objects composed of a simplicial set and a cyclic set along with suitable compatibility data. $\sP$ inherits a model structure from the…
Quillen showed that simplicial sets form a model category (with appropriate choices of three classes of morphisms), which organized the homotopy theory of simplicial sets. His proof is very difficult and uses even the classification theory…
We prove that the category of dg-modules and dg-algebras in a Grothendieck quasi-abelian category are endowed with a Quillen model structure. This allows some flexibility in setting up a theory of derived algebraic geometry in the infinite…
This paper is the second in a series of two papers about generalizing Quillen's Theorem A to strict $\infty$-categories. In the first one, we presented a proof of this Theorem A of a simplicial nature, direct but somewhat ad hoc. In the…
A $k$-connected set in an infinite graph, where $k > 0$ is an integer, is a set of vertices such that any two of its subsets of the same size $\ell \leq k$ can be connected by $\ell$ disjoint paths in the whole graph. We characterise the…
The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…
We show that Quillen's resolution theorem for K-theory also applies to exact $\infty$-categories. We introduce heart structures on a stable $\infty$-category, generalizing weight structures, and using resolution ideas, we show that the…
We show that the category of algebraically cofibrant objects in a combinatorial and simplicial model category A has a model structure that is left-induced from that on A. In particular it follows that any presentable model category is…
We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…
There are various adjunctions between model (co-)slice and slice categories. We characterize when these adjunctions are Quillen equivalences. As an application, a triangle equivalence between the stable category of a Frobenius category and…
In this work, we introduce {\em topological representations of a quiver} as a system consisting of topological spaces and its relationships determined by the quiver. Such a setting gives a natural connection between topological…
We show that Quillen's formalism for computing the Chern character of the index using superconnections extends to arbitrary operators with functional calculus. We thus remove the condition that the operators have, up to homotopy, a gap in…
Multilevel modeling extends traditional modeling techniques with a potentially unlimited number of abstraction levels. Multilevel models can be formally represented by multilevel typed graphs whose manipulation and transformation are…
A relational structure is a core, if all its endomorphisms are embeddings. This notion is important for computational complexity classification of constraint satisfaction problems. It is a fundamental fact that every finite structure has a…
We show that the independence complexes of generalised Mycielskian of complete graphs are homotopy equivalent to a wedge sum of spheres, and determine the number of copies and the dimensions of these spheres. We also prove that the…