English
Related papers

Related papers: Lower Bound Theorems and a Generalized Lower Bound…

200 papers

An equitable coloring of a graph $G$ is a proper vertex coloring of $G$ such that the sizes of any two color classes differ by at most one. In the paper, we pose a conjecture that offers a gap-one bound for the smallest number of colors…

Discrete Mathematics · Computer Science 2020-04-30 Janusz Dybizbański , Hanna Furmańczyk , Vahan Mkrtchyan

Let Y be a random d-dimensional subcomplex of the (n-1)-dimensional simplex S obtained by starting with the full (d-1)-dimensional skeleton of S and then adding each d-simplex independently with probability p=c/n. We compute an explicit…

Combinatorics · Mathematics 2011-08-04 L. Aronshtam , N. Linial , T. Luczak , R. Meshulam

An embedded manifold is dual defective if its dual variety is not a hypersurface. Using the geometry of the variety of lines through a general point, we characterize scrolls among dual defective manifolds. This leads to an optimal bound for…

Algebraic Geometry · Mathematics 2014-11-25 Paltin Ionescu , Francesco Russo

In this paper, we study some relationships existing between some particular mathematical structures: discrete surfaces coming from discrete topology and mathematical morphology, poset-based connected manifolds coming from discrete topology,…

Algebraic Topology · Mathematics 2025-08-05 Nicolas Boutry

For a simplicial complex $X$, the $d$-clique complex $\Delta_d(X)$ is the simplicial complex having all subsets of vertices whose $(d + 1)$-subsets are contained by $X$ as its faces. We prove that if $p = n^{\alpha}$, with $\alpha <…

Combinatorics · Mathematics 2018-06-07 Demet Taylan

An equation is called graph-regular if it always has monochromatic solutions under edge-colorings of the complete graph on the naturals. We present two Rado-like conditions which are respectively necessary and sufficient for an equation to…

Combinatorics · Mathematics 2012-02-14 Andy Parrish

In [{Structural properties and decomposition of linear balanced matrices}, {\it Mathematical Programming}, 55:129--168, 1992], Conforti and Rao conjectured that every balanced bipartite graph contains an edge that is not the unique chord of…

It was conjectured by the third author in about 1973 that every $d$-regular planar graph (possibly with parallel edges) can be $d$-edge-coloured, provided that for every odd set $X$ of vertices, there are at least $d$ edges between $X$ and…

Discrete Mathematics · Computer Science 2012-09-07 Maria Chudnovsky , Katherine Edwards , Paul Seymour

The study of comparison theorems in geometry has a rich history. In this paper, we establish a comparison theorem for polyhedra in 3-manifolds with nonnegative scalar curvature, answering affirmatively a dihedral rigidity conjecture by…

Differential Geometry · Mathematics 2019-06-26 Chao Li

Under mild conditions on $n,p$, we give a lower bound on the number of $n$-variable balanced symmetric polynomials over finite fields $GF(p)$, where $p$ is a prime number. The existence of nonlinear balanced symmetric polynomials is an…

Combinatorics · Mathematics 2007-05-23 Thomas W. Cusick , Yuan Li , Pantelimon Stanica

We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…

Combinatorics · Mathematics 2026-02-10 Édouard Bonnet , Julien Duron , John Sylvester , Viktor Zamaraev , Maksim Zhukovskii

Motivated by different characterizations of planar graphs and the 4-Color Theorem, several structural results concerning graphs of high chromatic number have been obtained. Toward strengthening some of these results, we consider the…

Combinatorics · Mathematics 2025-08-07 Andrea Jiménez , Jessica McDonald , Reza Naserasr , Kathryn Nurse , Daniel A. Quiroz

We prove a structural theorem that provides a precise local picture of how a sequence of closed embedded minimal hypersurfaces with uniformly bounded index (and volume if the ambient dimension is greater than three) in a Riemannian manifold…

Differential Geometry · Mathematics 2019-07-01 Otis Chodosh , Daniel Ketover , Davi Maximo

Standard singularity theorems are proven in Lorentzian manifolds of arbitrary dimension n if they contain closed trapped submanifolds of arbitrary co-dimension. By using the mean curvature vector to characterize trapped submanifolds, a…

General Relativity and Quantum Cosmology · Physics 2014-11-21 Gregory J. Galloway , José M. M. Senovilla

We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…

Algebraic Geometry · Mathematics 2025-09-01 Cosimo Flavi , Joachim Jelisiejew , Mateusz Michałek

Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice…

Combinatorics · Mathematics 2010-02-17 Allen Knutson , Ezra Miller , Alexander Yong

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

We introduce a new model for random simplicial complexes which with high probability generates a complex that has a simply-connected double cover. Hence we develop a model for random simplicial complexes with fundamental group…

Combinatorics · Mathematics 2022-10-21 Florian Frick , Andrew Newman

Symmetric edge polytopes of graphs are important object in Ehrhart theory,and have an application to Kuramoto models. In the present paper, we study the upper and lower bounds for the number of facets of symmetric edge polytopes of…

Combinatorics · Mathematics 2025-05-01 Aki Mori , Kenta Mori , Hidefumi Ohsugi

Let $\mathcal{P}$ be the class of combinatorial 3-dimensional simple polytopes $P$, different from a tetrahedron, without 3- and 4-belts of facets. By the results of Pogorelov and Andreev, a polytope $P$ admits a realisation in Lobachevsky…

Algebraic Topology · Mathematics 2017-03-21 Victor Buchstaber , Taras Panov