Related papers: Some old and new problems in combinatorial geometr…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

The conjecture of Peter Horak and Alex Rosa (generalizing that of Marco Buratti) states that a multiset L of v-1 positive integers not exceeding [v/2] is the list of edge-lengths of a suitable Hamiltonian path of the complete graph with…

Koml\'os conjectured in 1981 that among all graphs with minimum degree at least $d$, the complete graph $K_{d+1}$ minimises the number of Hamiltonian subsets, where a subset of vertices is Hamiltonian if it contains a spanning cycle. We…

We solve a problem posed by Cardinali and Sastry [2] about factorization of $2$-covers of finite classical generalized quadrangles. To that end, we develop a general theory of cover factorization for generalized quadrangles, and in…

This paper establishes an analogue of the Robinson--Schensted correspondence for cylindric tableaux. In particular, for any pair of positive integers $(d,L)$, we construct a bijection between permutations that avoid the patterns $d\cdots 1…

Kalai's $3^d$ conjecture states that every centrally-symmetric $d$-polytope has at least $3^d$ faces. We give short proofs for two special cases: if $P$ is unconditional (that is, invariant w.r.t. reflection in any coordinate hyperplane),…

First, we study constructible subsets of $\A^n_k$ which contain a line in any direction. We classify the smallest such subsets in $\A^3$ of the type $R\cup\{g\neq 0\},$ where $g\in k[x_1,...,x_n]$ is irreducible of degree $d$, and $R\subset…

We describe some combinatorial problems in finite projective planes and indicate how R\'edei's theory of lacunary polynomials can be applied to them.

Tucker's Lemma is a combinatorial analog of the Borsuk-Ulam theorem and the case n=2 was proposed by Tucker in 1945. Numerous generalizations and applications of the Lemma have appeared since then. In 2006 Meunier proved the Lemma in its…

In a paper from 1954 Marstrand proved that if K is a Borel subset of the plane with Hausdorff dimension greater than 1, then its one-dimensional projection has positive Lebesgue measure for almost-all directions. In this article, we give a…

Generalizing the famous 14-set closure-complement Theorem of Kuratowski from 1922, we prove that for a set $X$ endowed with $n$ pairwise comparable topologies $\tau_1\subset\dots\subset\tau_n$, by repeated application of the operations of…

The Generalized Discretizable Molecular Distance Geometry Problem is a distance geometry problems that can be solved by a combinatorial algorithm called ``Branch-and-Prune''. It was observed empirically that the number of solutions of YES…

We introduce and study a new family of extensions for the Borsuk-Ulam and topological Radon type theorems. The defining idea for this new family is to replace requirements of the form `a subset that is large in some sense goes to a…

We address an old (1977) conjecture of a subset of the authors (a variant of Ryser's conjecture): in every r-coloring of the edges of a biclique [A,B] (complete bipartite graph), the vertex set can be covered by the vertices of at most 2r-2…

In 1965 Erd\H{o}s asked, what is the largest size of a family of $k$-element subsets of an $n$-element set that does not have a matching of size $s+1$? In this note, we improve upon a recent result of Frankl and resolve this problem for…

Let $D = d_1, d_2, \ldots, d_n$ and $F = f_1, f_2,\ldots, f_n$ be two sequences of positive integers. We consider the following decision problems: is there a $i)$ multigraph, $ii)$ loopless multigraph, $iii)$ simple graph, $iv)$ connected…

The discrete cube $\{0,1\}^d$ is a fundamental combinatorial structure. A subcube of $\{0,1\}^d$ is a subset of $2^k$ of its points formed by fixing $k$ coordinates and allowing the remaining $d-k$ to vary freely. The subcube structure of…

A seminal result in the theory of toric varieties, due to Knudsen, Mumford and Waterman (1973), asserts that for every lattice polytope $P$ there is a positive integer $k$ such that the dilated polytope $kP$ has a unimodular triangulation.…

P. Erd\H{o}s, J. Pach, R. Pollack, and Z. Tuza [J. Combin. Theory, B 47 (1989), 279--285] made conjectures for the maximum diameter of connected graphs without a complete subgraph $K_{k+1}$, which have order $n$ and minimum degree $\delta$.…

Suppose that $C$ is a centrally symmetric $d$-dimensional convex polytope; in 1989 Kalai conjectured that $C$ has at least $3^d$ facets. We prove this result if there are $d$ hyperplanes with orthogonal normal vectors so that $C$ is…