Related papers: A polynomial bound for the minimal excluded minors…

In this paper, we consider a closed Riemannian manifold $M^{n+1}$ with dimension $3\leq n+1\leq 7$, and a compact Lie group $G$ acting as isometries on $M$ with cohomogeneity at least $3$. After adapting the Almgren-Pitts min-max theory to…

We prove a new lower bound for the dilatation of an arbitrary pseudo-Anosov map on a surface of genus g with n punctures. Our bound improves the former super-exponential dependence on the genus by a polynomial dependence.

In this paper we associate to each multivariate polynomial $f$ that is homogeneous relative to a subset of its variables a series of polynomial families $P_\lambda (f)$ of $m$-tuples of homogeneous polynomials of equal degree such that the…

The boxicity (respectively cubicity) of a graph $G$ is the minimum non-negative integer $k$, such that $G$ can be represented as an intersection graph of axis-parallel $k$-dimensional boxes (respectively $k$-dimensional unit cubes) and is…

When we consider the action of a finite group on a polynomial ring, a polynomial unchanged by the action is called an invariant polynomial. A famous result of Noether states that in characteristic zero the maximal degree of a minimal…

Menger's theorem is an important building block of numerous results in the study of graph structure. We consider a variant in terms of coarse geometry. We say that a set of graphs has the weak coarse Menger property if there exist functions…

Upper bounds on the maximum number of minimal codewords in a binary code follow from the theory of matroids. Random coding provide lower bounds. In this paper we compare these bounds with analogous bounds for the cycle code of graphs. This…

The assignments of a set of $m$ items into $n$ clusters of prescribed sizes $k_1,\dots,k_n$ can be encoded as the vertices of the partition polytope $\mathrm{PP}(k_1,\dots,k_n)$. We prove that, if $K = \max\{k_1,\dots,k_n\}$, then the…

We study a new geometric graph parameter $\egd(G)$, defined as the smallest integer $r\ge 1$ for which any partial symmetric matrix which is completable to a correlation matrix and whose entries are specified at the positions of the edges…

The segment number of a planar graph $G$ is the smallest number of line segments needed for a planar straight-line drawing of $G$. Dujmovi\'c, Eppstein, Suderman, and Wood [CGTA'07] introduced this measure for the visual complexity of…

In this paper, we establish that the class of $\{P_6, (2,2)\text{-broom}\}$-free graphs contains a subclass $\mathcal{L}_i$, defined by certain cutset conditions, whose chromatic number admits a linear $\chi$-bound. Building on recent…

Let $\Sigma$ be a surface with boundary $b(\Sigma)$, $\mathcal{L}$ be a collection of $k$ disjoint $b(\Sigma)$-paths in $\Sigma$, and $P$ be a non-separating $b(\Sigma)$-path in $\Sigma$. We prove that there is a homeomorphism $\phi: \Sigma…

Karger (SIAM Journal on Computing, 1999) developed the first fully-polynomial approximation scheme to estimate the probability that a graph $G$ becomes disconnected, given that its edges are removed independently with probability $p$. This…

Linear upper bounds may be derived by imposing specific structural conditions on a generating set, such as additional constraints on ranks, eigenvalues, or the degree of the minimal polynomial of the generating matrices. This paper…

We give an algorithm that, given graphs $G$ and $H$, tests whether $H$ is a minor of $G$ in time ${\cal O}_H(n^{1+o(1)})$; here, $n$ is the number of vertices of $G$ and the ${\cal O}_H(\cdot)$-notation hides factors that depend on $H$ and…

Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…

Let $L$ be a non-split prime alternating link with $n>0$ crossings. We show that for each fixed $g$, the number of genus-$g$ Seifert surfaces for $L$ is bounded by an explicitly given polynomial in $n$. The result also holds for all…

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

Kuratowski proved that a finite graph embeds in the plane if it does not contain a subdivision of either K_5 or K_{3,3}, called Kuratowski subgraphs. A conjectured generalization of this result to all nonorientable surfaces says that a…

The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, improve upper…