English
Related papers

Related papers: Complete Kneser Transversals

200 papers

Motivated by the problem of integer sparse recovery we study the following question. Let $A$ be an $m \times d$ integer matrix whose entries are in absolute value at most $k$. How large can be $d=d(m,k)$ if all $m \times m$ submatrices of…

Combinatorics · Mathematics 2019-10-11 Sergei Konyagin , Benny Sudakov

Motivated from the surrounding property of a point set in $\mathbb{R}^d$ introduced by Holmsen, Pach and Tverberg, we consider the transversal number and chromatic number of a simplicial sphere. As an attempt to give a lower bound for the…

Combinatorics · Mathematics 2023-07-25 Joseph Briggs , Michael Gene Dobbins , Seunghun Lee

We consider quadruples of positive integers $(a,b,m,n)$ with $a\leq b$ and $m\leq n$ such that any proper edge-coloring of the complete bipartite graph $K_{m,n}$ contains a rainbow $K_{a,b}$ subgraph. We show that any such quadruple with…

Combinatorics · Mathematics 2015-06-26 Stephan Cho , Jay Cummings , Colin Defant , Claire Sonneborn

For fixed positive integers $r, k$ and $\ell$ with $1 \leq \ell < r$ and an $r$-uniform hypergraph $H$, let $\kappa (H, k,\ell)$ denote the number of $k$-colorings of the set of hyperedges of $H$ for which any two hyperedges in the same…

Combinatorics · Mathematics 2011-03-01 Carlos Hoppen , Yoshiharu Kohayakawa , Hanno Lefmann

A family of axis-aligned boxes in $\er^d$ is \emph{$k$-neighborly} if the intersection of every two of them has dimension at least $d-k$ and at most $d-1$. Let $n(k,d)$ denote the maximum size of such a family. It is known that $n(k,d)$ can…

Combinatorics · Mathematics 2023-03-06 Noga Alon , Jarosław Grytczuk , Andrzej P. Kisielewicz , Krzysztof Przesławski

Let H be a k-uniform hypergraph whose vertices are the integers 1,...,N. We say that H contains a monotone path of length n if there are x_1 < x_2 < ... < x_{n+k-1} so that H contains all n edges of the form {x_i,x_{i+1},...,x_{i+k-1}}. Let…

Combinatorics · Mathematics 2012-06-19 Guy Moshkovitz , Asaf Shapira

The generalized Kneser hypergraph $KG^{r}(n,k,s)$ is the hypergraph whose vertices are all the $k$-subsets of $\{1,\ldots ,n\}$, and edges are $r$-tuples of distinct vertices such that any pair of them has at most $s$ elements in their…

Combinatorics · Mathematics 2018-10-30 Hamid Reza Daneshpajouh

We prove that the canonical orientation of the generalized Kneser graph $KG(n,k,s)$ contains a directed Hamiltonian cycle for all integers $s \geq 3$ and $n>sk$. Furthermore, we establish that the dichromatic number of this oriented graph…

Combinatorics · Mathematics 2026-05-28 Shahram Mehry

Let $\gamma^d_m(K)$ be the smallest positive number $\lambda$ such that the convex body $K$ can be covered by $m$ translates of $\lambda K$. Let $K^d$ be the $d$-dimensional crosspolytope. It will be proved that $\gamma^d_m(K^d)=1$ for…

Metric Geometry · Mathematics 2023-05-24 Antal Joós

Let k be a field of positive characteristic. We construct, for each dominant coweight \lambda of the standard maximal torus in the special linear group, a closed subvariety D(\lambda) of the multigraded Hilbert scheme of an affine space…

Algebraic Geometry · Mathematics 2010-10-05 Martin Kreidl

We establish a colorful and, more generally, matroidal solution to the problem of Goodman and Pollack on the existence of an $\mathbb{F}$-affine $k$-dimensional transversal to a family of convex sets in $\mathbb{F}^d$, where $0 \le k \le d…

Combinatorics · Mathematics 2026-05-19 Nikola Sadovek

The Kneser graph $K(n,d)$ is the graph on the $d$-subsets of an $n$-set, adjacent when disjoint. Clearly, $K(n+d,d)$ is locally $K(n,d)$. Hall showed for $n \ge 3d+1$ that there are no further examples. Here we give other examples of…

Combinatorics · Mathematics 2023-12-06 A. E. Brouwer

For a positive integer $d$, a $d$-transversal set of a graph $G$ is an edge subset $T\subseteq E(G)$ such that $|T\cap M|\geq d$ for every maximum matching $M$ of $G$. The $d$-transversal number of $G$, denoted by $\tau_d(G)$, is the…

Combinatorics · Mathematics 2026-02-24 Hailun Wu , Heping Zhang

In this article, we give explicit examples of infinitely many non-commensurable (non-arithmetic) hyperbolic $3$-manifolds admitting exactly $k$ totally geodesic surfaces for any positive integer $k$, answering a question of Bader, Fisher,…

Geometric Topology · Mathematics 2022-08-31 Khanh Le , Rebekah Palmer

Let $D_\lambda^{d,k}$ denote the family of diagonal hypersurface over a finite field $\mathbb{F}_q$ given by \begin{align*} D_\lambda^{d,k}:X_1^d+X_2^d=\lambda dX_1^kx_2^{d-k}, \end{align*} where $d\geq2$, $1\leq k\leq d-1$, and…

Number Theory · Mathematics 2023-07-25 Sulakashna , Rupam Barman

Considering a natural generalization of the Ruzsa-Szemer\'edi problem, we prove that for any fixed positive integers $r,s$ with $r<s$, there are graphs on $n$ vertices containing $n^{r}e^{-O(\sqrt{\log{n}})}=n^{r-o(1)}$ copies of $K_s$ such…

Combinatorics · Mathematics 2022-02-28 W. T. Gowers , Barnabás Janzer

We show for each positive integer $a$ that, if $\cM$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $n$ such that either every rank-$r$ matroid in $\cM$ can be covered by…

Combinatorics · Mathematics 2012-09-10 Jim Geelen , Peter Nelson

Rado's theorem about permutahedra and dominance order on partitions reveals that each Schur polynomial is M-convex, or equivalently, it has a saturated Newton polytope and this polytope is a generalized permutahedron as well. In this paper…

Combinatorics · Mathematics 2024-01-29 Bo Wang , Candice X. T. Zhang , Zhong-Xue Zhang

For a bilinear map $*:\mathbb R^d\times \mathbb R^d\to \mathbb R^d$ of nonnegative coefficients and a vector $s\in \mathbb R^d$ of positive entries, among an exponentially number of ways combining $n$ instances of $s$ using $n-1$…

Discrete Mathematics · Computer Science 2021-04-22 Vuong Bui

For all integers $k,d$ such that $k \geq 3$ and $k/2\leq d \leq k-1$, let $n$ be a sufficiently large integer {\rm(}which may not be divisible by $k${\rm)} and let $s\le \lfloor n/k\rfloor-1$. We show that if $H$ is a $k$-uniform hypergraph…

Combinatorics · Mathematics 2022-08-16 Yulin Chang , Huifen Ge , Jie Han , Guanghui Wang