Related papers: Shrinkability, relative left properness, and deriv…
A graph $G$ is called equiarboreal if the number of spanning trees containing a given edge in $G$ is independent of the choice of edge. In [Combinatorica 1(2) (1981) 163--167], Godsil proved that any graph which is a colour class in an…
We introduce and study the {\em orderly spanning trees} of plane graphs. This algorithmic tool generalizes {\em canonical orderings}, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning…
It is proved that MacLane's coherence results for monoidal and symmetric monoidal categories can be extended to some other categories with multiplication; namely, to relevant, affine and cartesian categories. All results are formulated in…
Let $G$ be a connected reductive algebraic group over an algebraically closed field $k$ of characteristic $p > 0$ and let $\ell$ be a prime number different from $p$. Let $U \subseteq G$ be a maximal unipotent subgroup, $T$ a maximal torus…
In Partition Into Complementary Subgraphs (Comp-Sub) we are given a graph $G=(V,E)$, and an edge set property $\Pi$, and asked whether $G$ can be decomposed into two graphs, $H$ and its complement $\overline{H}$, for some graph $H$, in such…
A connected graph $G$, of order two or more, is matching covered if each edge lies in some \pema. The tight cut decomposition of a matching covered graph $G$ yields a list of bricks and braces; as per a theorem of Lov{\'a}sz~\cite{lova87},…
In this paper, which is subsequent to our previous paper [PS] (but can be read independently from it), we continue our study of the closed model structure on the category $\mathrm{Cat}_{\mathrm{dgwu}}(\Bbbk)$ of small weakly unital dg…
A graph $G$ is well-covered if all maximal independent sets are of the same cardinality. Let $w:V(G) \longrightarrow\mathbb{R}$ be a weight function. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight. An…
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)…
As we proved earlier, for a triangulated category $\underline{C}$ endowed with a weight structure $w$ and a triangulated subcategory $\underline{D}$ of $\underline{C}$ (strongly) generated by cones of a set of morphisms $S$ in the heart…
We give an abstract criterion for pasting pseudofunctors on two subcategories of a category into a pseudofunctor on the whole category. As an application we extend the variance theory of the twisted inverse image $(-)^!$ over schemes to…
For a small simplicial 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 homotopy-coherent nerve of A provides a left Quillen equivalence between…
We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…
We discuss a variant of the category of dendroidal sets, the so-called closed dendroidal sets which are indexed by trees without leaves. This category carries a Quillen model structure which behaves better than the one on general dendroidal…
Property $(P)$, introduced in recent work and rooted in the classical theory of Parter vertices, concerns the existence of a nonsingular matrix $A\in S(G)$ for which every vertex of $G$ is a $P$-vertex. Previous investigations have fully…
We construct a model structure on the category of cubical sets with connections whose cofibrations are the monomorphisms and whose fibrant objects are defined by the right lifting property with respect to inner open boxes, the cubical…
A graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of…
A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that…
In a recent paper we introduced a much weaker and easy to verify structure than a model category, which we called a "weak fibration category". We further showed that a small weak fibration category can be "completed" into a full model…
Commability is the finest equivalence relation between locally compact groups such that $G$ and $H$ are equivalent whenever there is a continuous proper homomorphism $G \to H$ with cocompact image. Answering a question of Cornulier, we show…