Related papers: The de Bruijn-Erd\"os-Hanani theorem

We prove a fixed point theorem that combines the contraction mapping principle and some Knaster-Tarski-like theorem. As a consequence we obtain an existence theorem to initial value problem for ordinary differential equation with…

In connection with some recent results by J. Bourgain and H. Abdalaoui, M. Lemanczyk, T. De La Rue (ALR) we present a short proof of Bourgain's theorem on Mobius orthogonality property for bounded rank-one constructions. The proof of the…

Additive combinatorics asks for lower bounds on sumsets and restricted sumsets over finite fields. Central examples are the Cauchy-Davenport theorem and the Erd\H{o}s-Heilbronn conjecture. In this note, we develop Das's linear algebraic…

Here we give a short survey of our new results. References to the complete proofs can be found in the text of this article and in the litterature.

We give a new proof of a theorem of B.M. Bredihin which was originally proved by extending Linnik's solution, via his dispersion method, of a problem of Hardy and Littlewood.

Fix an integer $s \ge 2$. Let $\mathcal{P}$ be a set of $n$ points and let $\mathcal{L}$ be a set of lines in a linear space such that no line in $\mathcal{L}$ contains more than $(n-1)/(s-1)$ points of $\mathcal{P}$. Suppose that for every…

The Brown-Erd\H{o}s-S\'{o}s conjecture, one of the central conjectures in extremal combinatorics, states that for any integer $m\geq 6,$ if a 3-uniform hypergraph on $n$ vertices contains no $m$ vertices spanning at least $m-3$ edges, then…

We introduce a common generalization of the strong Hanani-Tutte theorem and the weak Hanani-Tutte theorem: if a graph $G$ has a drawing $D$ in the plane where every pair of independent edges crosses an even number of times, then $G$ has a…

The "unit theorem" to which the present mini-course is devoted is a theorem from algebra that has a combinatorial flavour, and that originated in fact from algebraic combinatorics. Beyond a proof, the course also addresses applications, one…

This paper gives a self-contained group-theoretic proof of a dual version of a theorem of Ore on distributive intervals of finite groups. We deduce a bridge between combinatorics and representations in finite group theory.

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

This article contains the proof of a theorem on orthogonal-Pin duality that was cited without proof in a previous article in this journal.

In this paper, we formulate and prove several variants of the Erd\H{o}s-Tur\'{a}n additive bases conjecture.

In this short note we provide a relatively simple proof of the Erd\H{o}s-Hajnal conjecture for families of finite (hyper-)graphs without the $k$-order property. It was originally proved by M. Malliaris and S. Shelah in "Regularity lemmas…

Motivated by a well-known result in extremal set theory, due to Nicolaas Govert de Bruijn and Paul Erd\H{o}s, we consider curves in the unit $n$-cube $[0,1]^n$ of the form \[ A=\{(x,f_1(x),\ldots,f_{n-2}(x),\alpha): x\in [0,1]\}, \] where…

We give a remarkably elementary proof of the Brouwer fixed point theorem. The proof is verifiable for most of the mathematicians.

We reprove the strong Hanani-Tutte theorem on the projective plane. In contrast to the previous proof by Pelsmajer, Schaefer and Stasi, our method is constructive and does not rely on the characterization of forbidden minors, which gives…

We prove the well-known Brown-Erd\H{o}s-S\'os Conjecture for hypergraphs of large uniformity in the following form: any dense linear $r$-graph $G$ has $k$ edges spanning at most $(r-2)k+3$ vertices, provided the uniformity $r$ of $G$ is…

A de Bruijn cycle is a cyclic listing of length A, of a collection of A combinatorial objects, so that each object appears exactly once as a set of consecutive elements in the cycle. In this paper, we show the power of de Bruijn's original…

In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this…