Related papers: Shrinkability, relative left properness, and deriv…
Deciding whether there is a single tree -a supertree- that summarizes the evolutionary information in a collection of unrooted trees is a fundamental problem in phylogenetics. We consider two versions of this question: agreement and…
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…
Let C be an integral fusion category. We study some graphs, called the prime graph and the common divisor graph, related to the Frobenius-Perron dimensions of simple objects in the category C, that extend the corresponding graphs associated…
Given a combinatorial (semi-)model category $M$ and a set of morphisms $C$, we establish the existence of a semi-model category $L_C M$ satisfying the universal property of the left Bousfield localization in the category of semi-model…
An edge-coloured graph $G$ is called $properly$ $connected$ if every two vertices are connected by a proper path. The $proper$ $connection$ $number$ of a connected graph $G$, denoted by $pc(G)$, is the smallest number of colours that are…
Let $G$ be a $3$-connected graph with a $3$-connected (or sufficiently small) simple minor $H$. We establish that $G$ has a forest $F$ with at least $\left\lceil(|G|-|H|+1)/2\right\rceil$ edges such that $G/e$ is $3$-connected with an…
We study the simplicial coalgebra of chains on a simplicial set with respect to three notions of weak equivalence. To this end, we construct three model structures on the category of reduced simplicial sets for any commutative ring R. The…
A class of structures is monadically dependent if one cannot interpret all graphs in colored expansions from the class using a fixed first-order formula. A tree-ordered $\sigma$-structure is the expansion of a $\sigma$-structure with a…
A graph operation that {\em contracts edges} is one of the fundamental operations in the theory of graph minors. Parameterized Complexity of editing to a family of graphs by contracting $k$ edges has recently gained substantial scientific…
The {\em disjointness graph} $G=G({\cal S})$ of a set of segments ${\cal S}$ in $R^d$, $d\ge 2,$ is a graph whose vertex set is ${\cal S}$ and two vertices are connected by an edge if and only if the corresponding segments are disjoint. We…
Equitable list arboricity, introduced by Zhang in 2016, generalizes the notion of equitable list coloring by requiring the subgraph induced by each color class to be acyclic (instead of edgeless) in addition to the usual upper bound on the…
Model-driven software engineering is a suitable method for dealing with the ever-increasing complexity of software development processes. Graphs and graph transformations have proven useful for representing such models and changes to them.…
Pairwise compatibility graphs (PCGs) with non-negative integer edge weights recently have been used to describe rare evolutionary events and scenarios with horizontal gene transfer. Here we consider the case that vertices are separated by…
In previous work, we showed that there are appropriate model category structures on the category of simplicial categories and on the category of Segal precategories, and that they are Quillen equivalent to one another and to Rezk's complete…
Hierarchical embedding constraints define a set of allowed cyclic orders for the edges incident to the vertices of a graph. These constraints are expressed in terms of FPQ-trees. FPQ-trees are a variant of PQ-trees that includes F-nodes in…
Given a graph G and an integer k, the objective of the $\Pi$-Contraction problem is to check whether there exists at most k edges in G such that contracting them in G results in a graph satisfying the property $\Pi$. We investigate the…
Using Dugger's construction of universal model categories, we produce replacements for simplicial and combinatorial symmetric monoidal model categories with better operadic properties. Namely, these replacements admit a model structure on…
We show that a map between fibrant objects in a closed model category is a weak equivalence if and only if it has the right homotopy extension lifting property with respect to all cofibrations. The dual statement holds for maps between…
We introduce the notion of delineation. A graph class $\mathcal C$ is said delineated if for every hereditary closure $\mathcal D$ of a subclass of $\mathcal C$, it holds that $\mathcal D$ has bounded twin-width if and only if $\mathcal D$…
It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive…