English
Related papers

Related papers: f-vectors implying vertex decomposability

200 papers

Let $\rho$ be a metric on the set $X=\{1,2,\dots,n+1\}$. Consider the $n$-dimensional polytope of functions $f:X\rightarrow \mathbb{R}$, which satisfy the conditions $f(n+1)=0$, $|f(x)-f(y)|\leq \rho(x,y)$. The question on classifying…

Combinatorics · Mathematics 2016-08-25 J. Gordon , F. Petrov

We consider the hypergraph Tur\'an problem of determining $\mathrm{ex}(n, S^d)$, the maximum number of facets in a $d$-dimensional simplicial complex on $n$ vertices that does not contain a simplicial $d$-sphere (a homeomorph of $S^d$) as a…

Combinatorics · Mathematics 2026-01-14 Andrew Newman , Marta Pavelka

We consider compact hyperbolic Coxeter polytopes whose Coxeter diagram contains a unique dotted edge. We prove that such a polytope in d-dimensional hyperbolic space has at most d+3 facets. In view of results of Lann\'er, Kaplinskaja,…

Metric Geometry · Mathematics 2022-09-13 Anna Felikson , Pavel Tumarkin

We study structural and topological properties of nested set complexes of matroids with arbitrary building sets, proving that these complexes are vertex decomposable and admit convex ear decompositions. These results unify and generalize…

Combinatorics · Mathematics 2026-01-19 Basile Coron , Luis Ferroni , Shiyue Li

This is the first in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a finite graph embedded on a surface of genus $g$. Then $G$ can be $L$-colored, where $L$ is a…

Combinatorics · Mathematics 2024-03-22 Joshua Nevin

In 1973 Bermond, Germa, Heydemann and Sotteau conjectured that if $n$ divides $\binom{n}{k}$, then the complete $k$-uniform hypergraph on $n$ vertices has a decomposition into Hamilton Berge cycles. Here a Berge cycle consists of an…

Combinatorics · Mathematics 2014-04-01 Daniela Kühn , Deryk Osthus

The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…

Combinatorics · Mathematics 2013-04-30 Francisco Santos

We show that the complex of partial bases of the free group of rank $n$, where vertices are seen up to conjugation, is Cohen--Macaulay of dimension $n-1$. This positively answers a conjecture raised by Day and Putman. We prove our results…

Geometric Topology · Mathematics 2025-09-26 Benjamin Brück , Kevin Ivan Piterman

Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.

Combinatorics · Mathematics 2017-09-19 Ferran Hurtado , Eduardo Rivera-Campo

Let $f(\mathbb{z},\bar{\mathbb{z}})$ be a convenient Newton non-degenerate mixed polynomial with strongly polar non-negative mixed weighted homogeneous face functions. We consider a convenient regular simplicial cone subdivision $\Sigma^*$…

Algebraic Geometry · Mathematics 2021-11-03 Sachiko Saito , Kosei Takashimizu

A simplicial complex is $r$-conic if every subcomplex of at most $r$ vertices is contained in the star of a vertex. A $4$-conic complex is simply connected. We prove that an $8$-conic complex is $2$-connected. In general a $(2n+1)$-conic…

Algebraic Topology · Mathematics 2021-03-09 Jonathan A. Barmak

We characterize $d$-uple Veronese embeddings of finite-dimensional projective spaces. The easiest non-trivial instance of our theorem is the embedding of the projective plane in 5-dimensional projective space, a result obtained in 1901 by…

Algebraic Geometry · Mathematics 2014-06-13 Jeroen Schillewaert , Koen Struyve

We consider a family of toroidal graphs, denoted by $\mathcal{T}_{i, j}$, which contain neither $i$-cycles nor $j$-cycles. A graph $G$ is $(d, h)$-decomposable if it contains a subgraph $H$ with $\Delta(H) \leq h$ such that $G - E(H)$ is a…

Combinatorics · Mathematics 2025-02-27 Tao Wang , Xiaojing Yang

Let $F$ be an $n$-vertex forest. We say that an edge $e\notin F$ is in the shadow of $F$ if $F\cup\{e\}$ contains a cycle. It is easy to see that if $F$ is "almost a tree", that is, it has $n-2$ edges, then at least…

Combinatorics · Mathematics 2015-11-13 Nati Linial , Ilan Newman , Yuval Peled , Yuri Rabinovich

We introduce and study the notion of "surface decomposable" variety, and discuss the possibility that any projective hyper-K\"ahler manifold is surface decomposable, which would produce new evidence for Beauville's weak splitting…

Algebraic Geometry · Mathematics 2018-10-30 Claire Voisin

Helmholtz decomposition theorem for vector fields is presented usually with too strong restrictions on the fields. Based on the work of Blumenthal of 1905 it is shown that the decomposition of vector fields is not only possible for…

Classical Physics · Physics 2015-10-15 D. Petrascheck , R. Folk

Given a set $S \subseteq \mathbb{R}^d$, a hollow polytope has vertices in $S$ but contains no other point of $S$ in its interior. We prove upper and lower bounds on the maximum number of vertices of hollow polytopes whose facets are…

Metric Geometry · Mathematics 2025-04-25 Srinivas Arun , Travis Dillon

Let $K$ be a simplicial complex on vertex set $V$. $K$ is called $d$-Leray if the homology groups of any induced subcomplex of $K$ are trivial in dimensions $d$ and higher. $K$ is called $d$-collapsible if it can be reduced to the void…

Combinatorics · Mathematics 2021-09-08 Minki Kim , Alan Lew

We present a substantial generalisation of a classical result by Lie on integrability by quadratures. Namely, we prove that all vector fields in a finite-dimensional transitive and solvable Lie algebra of vector fields on a manifold can be…

Mathematical Physics · Physics 2016-11-03 J. F. Cariñena , F. Falceto , J. Grabowski

The topological Tverberg theorem states that for any prime power q and continuous map from a (d+1)(q-1)-simplex to R}^d, there are q disjoint faces F_i of the simplex whose images intersect. It is possible to put conditions on which pairs…

Combinatorics · Mathematics 2011-09-14 Alexander Engstrom
‹ Prev 1 8 9 10 Next ›