English
Related papers

Related papers: A generalized lower bound theorem for balanced man…

200 papers

We prove that the coindex of the box complex $\mathrm{B}(H)$ of a graph $H$ can be measured by the generalised Mycielski graphs which admit a homomorphism to it. As a consequence, we exhibit for every graph $H$ a system of linear equations…

Combinatorics · Mathematics 2016-01-19 Gord Simons , Claude Tardif , David Wehlau

This paper studies the minimal number of vertices $\lambda(n,d)$ required in a triangulation of the $n$-sphere to admit a simplicial map to the boundary of a $(n+1)$-simplex with a given degree $d$. We establish upper bounds for…

Combinatorics · Mathematics 2026-01-21 Ksenia Apolonskaya , Oleg R. Musin

We note an intimate connection between the Lefschetz Theorem for c-arrangements, and a theorem of Hironaka relating the complement of an arrangement to its boundary manifold. This results in a generalization of Hironaka's result.

Geometric Topology · Mathematics 2015-03-20 Karim A. Adiprasito

This exposition contains a short and streamlined proof of the recent result of Kwan, Letzter, Sudakov and Tran that every triangle-free graph with minimum degree $d$ contains an induced bipartite subgraph with average degree $\Omega(\ln…

Combinatorics · Mathematics 2020-06-11 Stefan Glock

We prove a global version of the so-called div-curl-lemma, a crucial result for compensated compactness and in homogenization theory, for mixed tangential and normal boundary conditions in bounded weak Lipschitz domains in 3D and weak…

Analysis of PDEs · Mathematics 2018-12-18 Dirk Pauly

We establish a correspondence between trisections of smooth, compact, oriented $4$--manifolds with connected boundary and diagrams describing these trisected $4$--manifolds. Such a diagram comes in the form of a compact, oriented surface…

Geometric Topology · Mathematics 2017-07-27 Nickolas A. Castro , David T. Gay , Juanita Pinzón-Caicedo

A $\frac{1}{k}$-majority $l$-edge-colouring of a graph $G$ is a colouring of its edges with $l$ colours such that for every colour $i$ and each vertex $v$ of $G$, at most $\frac{1}{k}$'th of the edges incident with $v$ have colour $i$. We…

Combinatorics · Mathematics 2023-09-29 Paweł Pękała , Jakub Przybyło

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…

Combinatorics · Mathematics 2019-12-19 Jakub Przybyło

Let $\gg$ be a complex reductive Lie algebra and $\kk\subset\gg$ be any reductive in $\gg$ subalgebra. We call a $(\gg,\kk)$-module $M$ bounded if the $\kk$-multiplicities of $M$ are uniformly bounded. In this paper we initiate a general…

Representation Theory · Mathematics 2007-10-05 Ivan Penkov , Vera Serganova

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

Combinatorics · Mathematics 2018-11-20 Eran Nevo , Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

For $d \geq 2$, Walkup's class ${\cal K}(d)$ consists of the $d$-dimensional simplicial complexes all whose vertex-links are stacked $(d-1)$-spheres. Kalai showed that for $d \geq 4$, all connected members of ${\cal K}(d)$ are obtained from…

Geometric Topology · Mathematics 2015-03-13 Bhaskar Bagchi , Basudeb Datta

A Riemannian manifold is called harmonic if its volume density function expressed in polar coordinates centered at any point is radial. Flat and rank-one symmetric spaces are harmonic. The converse (the Lichnerowicz Conjecture) is true for…

Differential Geometry · Mathematics 2007-05-23 Y. Nikolayevsky

Let M be a (possibly non-orientable) compact 3-manifold with (possibly empty) boundary consisting of tori and Klein bottles. Let $X\subset\partial M$ be a trivalent graph such that $\partial M\setminus X$ is a union of one disc for each…

Geometric Topology · Mathematics 2007-05-23 Bruno Martelli , Carlo Petronio

The aim of this paper is twofold. On the one hand, it provides a review of the links between random tensor models, seen as quantum gravity theories, and the PL-manifolds representation by means of edge-colored graphs (crystallization…

Mathematical Physics · Physics 2018-03-08 Maria Rita Casali , Paola Cristofori , Stephane Dartois , Luigi Grasselli

The colourful simplicial depth problem in dimension d is to find a configuration of (d+1) sets of (d+1) points such that the origin is contained in the convex hull of each set (colour) but contained in a minimal number of colourful…

Combinatorics · Mathematics 2012-10-30 Antoine Deza , Tamon Stephen , Feng Xie

Mantel's theorem states that every $n$-vertex graph with $\lfloor \frac{n^2}{4} \rfloor +t$ edges, where $t>0$, contains a triangle. The problem of determining the minimum number of triangles in such a graph is usually referred to as the…

Combinatorics · Mathematics 2021-06-14 József Balogh , Felix Christian Clemen

We prove that a strongly connected balanced bipartite digraph $D$ of order $2a$ is hamiltonian, provided $a\geq3$ and $d(x)+d(y)\geq 3a$ for every pair of vertices $x$, $y$ with a common in-neighbour or a common out-neighbour in $D$.

Combinatorics · Mathematics 2015-12-03 Janusz Adamus

A classical result of Cheng states that the bottom spectrum of complete manifolds of fixed dimension and Ricci curvature lower bound achieves its maximal value on the corresponding hyperbolic space. The paper establishes an analogous result…

Differential Geometry · Mathematics 2024-06-05 Ovidiu Munteanu , Jiaping Wang

We present the Tetrahedral Compactness Theorem which states that sequences of Riemannian manifolds with a uniform upper bound on volume and diameter that satisfy a uniform tetrahedral property have a subsequence which converges in the…

Differential Geometry · Mathematics 2017-03-06 Christina Sormani

Hoffman proved that for a simple graph $G$, the chromatic number $\chi(G)$ obeys $\chi(G) \le 1 - \frac{\lambda_1}{\lambda_{n}}$ where $\lambda_1$ and $\lambda_n$ are the maximal and minimal eigenvalues of the adjacency matrix of $G$…

Combinatorics · Mathematics 2014-12-15 Franklin H. J. Kenter