English
Related papers

Related papers: Transversal numbers over subsets of linear spaces

200 papers

We prove a no-dimensional Helly theorem for affine spaces and convex sets using the unboundedness framework of Aronov, Goodman, and Pollack (Computational Geometry, 2002). This generalizes the fundamental result of Adiprasito, B\'ar\'any,…

Combinatorics · Mathematics 2025-12-01 Sutanoya Chakraborty , Arijit Ghosh , Soumi Nandi

For given simple graphs $H_1,H_2,\dots,H_c$, the multicolor Ramsey number $R(H_1,H_2,\dots,H_c)$ is defined as the smallest positive integer $n$ such that for an arbitrary edge-decomposition $\{G_i\}^c_{i=1}$ of the complete graph $K_n$, at…

Combinatorics · Mathematics 2023-08-22 Xuejun Zhang , Xinmin Hou

We consider a variation of Ramsey numbers introduced by Erd\H{o}s and Pach (1983), where instead of seeking complete or independent sets we only seek a $t$-homogeneous set, a vertex subset that induces a subgraph of minimum degree at least…

Combinatorics · Mathematics 2017-07-19 Ross J. Kang , János Pach , Viresh Patel , Guus Regts

A set $S$ of vertices in a hypergraph is \textit{strongly independent} if every hyperedge shares at most one vertex with $S$. We prove a sharp result for the number of maximal strongly independent sets in a $3$-uniform hypergraph analogous…

Combinatorics · Mathematics 2023-08-30 János Barát , Dániel Gerbner , Anastasia Halfpap

Given a graph $H$, the Ramsey number $r(H)$ is the smallest natural number $N$ such that any two-colouring of the edges of $K_N$ contains a monochromatic copy of $H$. The existence of these numbers has been known since 1930 but their…

Combinatorics · Mathematics 2015-05-12 David Conlon , Jacob Fox , Benny Sudakov

The {\em overlap number} of a finite $(d+1)$-uniform hypergraph $H$ is defined as the largest constant $c(H)\in (0,1]$ such that no matter how we map the vertices of $H$ into $\R^d$, there is a point covered by at least a $c(H)$-fraction of…

Combinatorics · Mathematics 2010-05-11 Jacob Fox , Mikhail Gromov , Vincent Lafforgue , Assaf Naor , Janos Pach

We establish the following fractional Hardy's inequality $$\int_{\mathbb{H}^n_+}\frac{|f(\xi)|^p}{x_1^{sp}|z|^\alpha}d\xi\leq C\int_{\mathbb{H}^n_+}\int_{\mathbb{H}^n_+}\frac{|f(\xi)-f(\xi')|^p}{d({\xi}^{-1}\circ…

Analysis of PDEs · Mathematics 2024-12-16 Rama Rawat , Haripada Roy

We prove that the set of directions of lines intersecting three disjoint balls in $R^3$ in a given order is a strictly convex subset of $S^2$. We then generalize this result to $n$ disjoint balls in $R^d$. As a consequence, we can improve…

Metric Geometry · Mathematics 2007-05-23 Ciprian Borcea , Xavier Goaoc , Sylvain Petitjean

Let H = (H,V) be a hypergraph with edge set H and vertex set V. Then hypergraph H is invertible iff there exists a permutation pi of V such that for all E belongs to H(edges) intersection of(pi(E) and E)=0. H is invertibility critical if H…

Combinatorics · Mathematics 2016-09-06 Emanuel Knill

Let $R^h$ denote the polynomial ring in variables $x_1,\,\ldots,\, x_h$ over a specified field $K$. We consider all of these rings simultaneously, and in each use lexicographic (lex) monomial order with $x_1 > \cdots > x_h$. Given a fixed…

Commutative Algebra · Mathematics 2020-03-03 Tigran Ananyan , Melvin Hochster

Let X be a normed space. A subset A of X is approximately convex if $d(ta+(1-t)b,A) \le 1$ for all $a,b \in A$ and $t \in [0,1]$ where $d(x,A)$ is the distance of $x$ to $A$. Let $\Co(A)$ be the convex hull and $\diam(A)$ the diameter of…

Functional Analysis · Mathematics 2007-05-23 S. J. Dilworth , Ralph Howard , James W. Roberts

We call the minimum order of any complete graph so that for any coloring of the edges by $k$ colors it is impossible to avoid a monochromatic or rainbow triangle, a Mixed Ramsey number. For any graph $H$ with edges colored from the above…

Combinatorics · Mathematics 2014-03-18 Marcus Bartlett , Elliot Krop , Thuhong Nguyen , Michael Ngo , Petra President

The Ramsey number $r(H)$ of a graph $H$ is the minimum integer $n$ such that any two-coloring of the edges of the complete graph $K_n$ contains a monochromatic copy of $H$. While this definition only asks for a single monochromatic copy of…

Combinatorics · Mathematics 2022-08-09 David Conlon , Jacob Fox , Benny Sudakov , Fan Wei

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

Algebraic Geometry · Mathematics 2024-10-15 Claus Scheiderer

Given an acyclic oriented graph $\vec{H}$ and a graph $G$, we write $G \to \vec{H}$ if every orientation of $G$ has an oriented copy of $\vec{H}$. We define $\vec{R}(\vec{H})$ as the smallest number $n$ such that there exists a graph $G$…

Combinatorics · Mathematics 2020-12-21 Bruno Pasqualotto Cavalar

This paper has been withdrawn Any real number $x$ in the unit interval can be expressed as a continued fraction $x=[n_1,...,n_{_N},...]$. Subsets of zero measure are obtained by imposing simple conditions on the $n_{_N}$. By imposing…

Number Theory · Mathematics 2012-01-20 Eda Cesaratto

Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…

Combinatorics · Mathematics 2024-02-14 Balázs Keszegh

We show that for arbitrary linearly ordered set $X$ any bounded family of (not necessarily, continuous) real valued functions on $X$ with bounded total variation does not contain independent sequences. We obtain generalized Helly's…

General Topology · Mathematics 2016-12-20 Michael Megrelishvili

We prove existence of Helly numbers for crystals and for cut-and-project sets with convex windows. Also we show that for a two-dimensional crystal consisting of $k$ copies of a single lattice the Helly number does not exceed $k+6$.

Metric Geometry · Mathematics 2024-02-14 Alexey Garber

Local realistic models cannot completely describe all predictions of quantum mechanics. This is known as Bell's theorem that can be revealed either by violations of Bell inequality, or all-versus-nothing proof of nonlocality. Hardy's…