Related papers: Higher minors and Van Kampen's obstruction

We introduce K-deformations of generalized complex structures on a compact Kahler manifold $M=(X, J)$ with an effective anti-canonical divisor and show that obstructions to K-deformations of generalized complex structures on $M$ always…

We obtain in this paper bounds for the capacity of a compact set $K$. If $K$ is contained in an $(n+1)$-dimensional Cartan-Hadamard manifold, has smooth boundary, and the principal curvatures of $\partial K$ are larger than or equal to…

Using the picture deformation technique of De Jong-Van Straten we show that no singularity whose resolution graph has 3 or 4 large nodes, i.e., nodes satisfying d(v)+e(v)\leq -2, has a QHD smoothing. This is achieved by providing a general…

This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…

The Graph Minor Theorem of Robertson and Seymour implies a finite set of obstructions for any minor closed graph property. We show that there are only three obstructions to knotless embedding of size 23, which is far fewer than the 92 of…

A complete structural characterization of graphs with no $K_{3,4}$ minor is obtained, and the following consequences are established. Every $4$-connected non-planar graph with at least seven vertices and minimum degree at least five…

We develop a new framework to study minimum $d$-degree conditions in $k$-uniform hypergraphs, which guarantee the existence of a tight Hamilton cycle. Our main theoretical result deals with the typical absorption, path cover and connecting…

We review a cochain-free treatment of the classical van Kampen obstruction \theta to embeddability of an n-polyhedron into R^{2n} and consider several analogues and generalizations of \theta, including an extraordinary lift of \theta which…

A minimal separator of a graph $G$ is a set $S \subseteq V(G)$ such that there exist vertices $a,b \in V(G) \setminus S$ with the property that $S$ separates $a$ from $b$ in $G$, but no proper subset of $S$ does. For an integer $k\ge 0$, we…

We construct harmonic diffeomorphisms from the complex plane $C$ onto any Hadamard surface $M$ whose curvature is bounded above by a negative constant. For that, we prove a Jenkins-Serrin type theorem for minimal graphs in $M\times R$ over…

For $1\le d\le \ell< k$, we give a new lower bound for the minimum $d$-degree threshold that guarantees a Hamilton $\ell$-cycle in $k$-uniform hypergraphs. When $k\ge 4$ and $d< \ell=k-1$, this bound is larger than the conjectured minimum…

A graph $G$ contains a graph $H$ as an induced minor if $H$ can be obtained from $G$ by vertex deletions and edge contractions. The class of $H$-induced-minor-free graphs generalizes the class of $H$-minor-free graphs, but unlike…

We study the quantum query complexity of constant-sized subgraph containment. Such problems include determining whether an $ n $-vertex graph contains a triangle, clique or star of some size. For a general subgraph $ H $ with $ k $…

A set of vertices in a graph is a Hamiltonian subset if it induces a subgraph containing a Hamiltonian cycle. Kim, Liu, Sharifzadeh and Staden proved that among all graphs with minimum degree $d$, $K_{d+1}$ minimises the number of…

We study curvature functionals for immersed 2-spheres in a compact, three-dimensional Riemannian manifold M. Under the assumption that the sectional curvature of M is strictly positive, we prove the existence of a smoothly immersed sphere…

For a smooth subvariety $X\subset\Bbb P^N$, consider (analogously to projective normality) the vanishing condition $H^1(\Bbb P^N,\Cal I^2_X(k))=0$, $k\ge3$. This condition is shown to be satisfied for all sufficiently large embeddings of a…

A fundamental result in structural graph theory states that every graph with large average degree contains a large complete graph as a minor. We prove this result with the extra property that the minor is small with respect to the order of…

We study dismantlability in graphs. In order to compare this notion to similar operations in posets (partially ordered sets) or in simplicial complexes, we prove that a graph G dismants on a subgraph H if and only if H is a strong…

For a graph invariant $\pi$, the Contraction($\pi$) problem consists in, given a graph $G$ and two positive integers $k,d$, deciding whether one can contract at most $k$ edges of $G$ to obtain a graph in which $\pi$ has dropped by at least…

Let ${\rm ex \,} {\mathcal B}$ be a minor-closed class of graphs with a set ${\mathcal B}$ of minimal excluded minors. We study (a) the asymptotic number of graphs without $k+1$ disjoint minors in ${\mathcal B}$ and (b) the properties of a…