Related papers: Free Minor Closed Classes and the Kuratowski theor…
A categorical formalism for directed graphs is introduced, featuring natural notions of morphisms and subgraphs, and leading to two elementary descriptions of the free-properad monad, first in terms of presheaves on elementary graphs,…
The theory of covering spaces is often used to prove the Nielsen-Schreier theorem, which states that every subgroup of a free group is free. We apply the more general theory of semicovering spaces to obtain analogous subgroup theorems for…
Extending several previous results we obtained nearly tight estimates on the maximum size of a clique-minor in various classes of expanding graphs. These results can be used to show that graphs without short cycles and other H-free graphs…
A graph is apex if it can be made planar by deleting a vertex, that is, $\exists v$ such that $G-v$ is planar. We define the related notions of edge apex, $\exists e$ such that $G-e$ is planar, and contraction apex, $\exists e$ such that…
The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely, the class of planar graphs. In the case of tree-width, the…
The calculus of classes and closure operations has proved to be a useful tool in group theory and has led to a deep theory in the study of finite soluble groups. More recently, parallel theories have started to be developed in various…
Dujmovi\'c et al. [\emph{J.~ACM}~'20] recently proved that every planar graph is isomorphic to a subgraph of the strong product of a bounded treewidth graph and a path. Analogous results were obtained for graphs of bounded Euler genus or…
Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…
The class of terminal planar networks was recently introduced from a biological perspective in relation to the visualization of phylogenetic networks, and its connection to upward planar networks has been established. We provide a…
We study graphs where each edge adjacent to a vertex of small degree (7 and 9, respectively) belongs to many triangles (4 and 5, respectively) and show that these graphs contain a complete graph (K_6 and K_7, respectively) as a minor. The…
We study the Borel subsets of the plane that can be made closed by refining the Polish topology on the real line. These sets are called potentially closed. We first compare Borel subsets of the plane using products of continuous functions.…
The Gr\"{o}tzsch Theorem states that every triangle-free planar graph admits a proper $3$-coloring. Among many of its generalizations, the one of Gr\"{u}nbaum and Aksenov, giving $3$-colorability of planar graphs with at most three…
Hadwiger's conjecture says that every $K_t$-minor free graph is $(t - 1)$-colorable. This problem has been proved for $t \leq 6$ but remains open for $t \geq 7$. $K_7$-minor free graphs have been proved to be $8$-colorable (Albar &…
A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey yields a half-page proof of the celebrated Gr\"otzsch Theorem that every planar triangle-free graph is 3-colorable. In this paper we use the…
In this paper we introduce a family of planar, modular and self-similar graphs which have small-world and scale-free properties. The main parameters of this family are comparable to those of networks associated to complex systems, and…
Kuratowski's 14-set theorem says that in a topological space, 14 is the maximum possible number of distinct sets which can be generated from a fixed set by taking closures and complements. In this article we consider the analogous questions…
A subgraph-universal graph/a topological minor-universal graph in a class of graphs $\mathcal{G}$ is a graph in $\mathcal{G}$ which contains every graph in $\mathcal{G}$ as a subgraph/topological minor. We prove that the class $\mathcal{P}$…
We point out the existence of a class of non-Gaussian yet free "quantum field theories" in 0+0 dimensions, based on a cubic action classified by simple Lie groups. A "three-pronged" version of the Wick theorem applies.
This is a survey paper on Morse theory and the existence problem for closed geodesics. The free loop space plays a central role, since closed geodesics are critical points of the energy functional. As such, they can be analyzed through…
We study the class of independence complexes of claw-free graphs. The main theorem give good bounds on the connectivity of these complexes, given bounds for a few subcomplexes of the same class. Two applications are presented. Firstly, we…