中文
相关论文

相关论文: The de Bruijn-Erd\"os theorem in incidence geometr…

200 篇论文

The paper is devoted to a somewhat idiosyncratic account of the theorem of de Bruijn-Erd\"{o}s and Hanani from the combinatorics of finite geometries and its various proofs. Among the proofs discussed are the original proofs by de…

组合数学 · 数学 2017-05-31 Nikolai V. Ivanov

A classical theorem of De Bruijn and Erd\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to…

In 1935, Philip Hall published what is often referred to as ``Hall's marriage theorem'' in a short paper (P.~Hall, On Representatives of Subsets, \textit{J. Lond. Math. Soc.} (1) \textbf{10} (1935), no.1, 26--30.) This paper has been very…

组合数学 · 数学 2025-04-01 Peter J. Cameron

De Bruijn and Erd\H{o}s proved that every noncollinear set of n points in the plane determines at least n distinct lines. We suggest a possible generalization of this theorem in the framework of metric spaces and provide partial results on…

组合数学 · 数学 2009-06-01 Xiaomin Chen , Vašek Chvátal

A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…

A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chv\'atal asked whether the same statement holds true in general metric spaces, where the line…

组合数学 · 数学 2021-10-26 Vašek Chvátal

Some mathematical theorems represent ideas that are discovered again and again in different forms. One such theorem is Hall's marriage theorem. This theorem is equivalent to several other theorems in combinatorics and optimization theory,…

组合数学 · 数学 2022-02-07 Twan Koperberg

De Bruijn and Erd\H{o}s proved that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chv\'atal suggested a possible generalization of this theorem in the framework of metric spaces. We provide…

组合数学 · 数学 2012-05-08 Ehsan Chiniforooshan , Vašek Chvátal

We develop the methods used by Rudnev and Wheeler to prove an incidence theorem between arbitrary sets of M\"{o}bius transformations and point sets in $\mathbb F_p^2$. We also note some asymmetric incidence results, and give applications of…

组合数学 · 数学 2022-11-18 Audie Warren , James Wheeler

In additive combinatorics, Erd\"{o}s-Szemer\'{e}di Conjecture is an important conjecture. It can be applied to many fields, such as number theory, harmonic analysis, incidence geometry, and so on. Additionally, its statement is quite easy…

组合数学 · 数学 2023-10-13 Sung-Yi Liao

Incidence theorems concern configurations of points, lines, and, more generally, higher-dimensional subspaces in projective space. Broadly speaking, such theorems fall into two classes: those that hold over an arbitrary division ring, such…

组合数学 · 数学 2026-03-24 Anton Izosimov

In this article a family of recursive and self-similar matrices is constructed. It is shown that the Pl\"ucker matrix of the Isotropic Grassmannian variety is a direct sum of this class of matrices.

组合数学 · 数学 2023-03-23 Jesús Carrillo-Pacheco

A well-known theorem of de Bruijn and Erd\H{o}s states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite…

组合数学 · 数学 2012-07-17 Ida Kantor , Balazs Patkos

Given a collection $\C$ of subsets of a finite set $X$, let $\bigcup \C = \cup_{S \in \C}S$. Philip Hall's celebrated theorem \cite{hall} concerning `systems of distinct representatives' tells us that for any collection $\C$ of subsets of…

组合数学 · 数学 2009-06-24 Andreas Dress , Mike Steel

We consider a set-valued mapping on a simple graph and ask for the existence of a disparate selection. The term disparate is defined in the paper and we present a sufficient and necessary condition for the existence of a disparate…

组合数学 · 数学 2022-02-17 Thomas Fischer

A set of n points in the plane which are not all collinear defines at least n distinct lines. Chen and Chv\'atal conjectured in 2008 that a similar result can be achieved in the broader context of finite metric spaces. This conjecture…

离散数学 · 计算机科学 2020-05-20 Pierre Aboulker , Laurent Beaudou , Martín Matamala , José Zamora

We introduce a geometric generalization of Hall's marriage theorem. For any family $F = \{X_1, \dots, X_m\}$ of finite sets in $\mathbb{R}^d$, we give conditions under which it is possible to choose a point $x_i\in X_i$ for every $1\leq i…

组合数学 · 数学 2016-02-02 Andreas Holmsen , Leonardo Martinez-Sandoval , Luis Montejano

We show that various classical theorems of real/complex linear incidence geometry, such as the theorems of Pappus, Desargues, M\"obius, and so on, can be interpreted as special cases of a single "master theorem" that involves an arbitrary…

组合数学 · 数学 2023-08-07 Sergey Fomin , Pavlo Pylyavskyy

A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…

组合数学 · 数学 2014-10-09 Vasek Chvatal

We give a brief exposition of the proof of the Cayley-Salmon theorem and its recent role in incidence geometry. Even when we don't use the properties of ruled surfaces explicitly, the regime in which we have interesting results in…

组合数学 · 数学 2014-04-15 Nets Hawk Katz
‹ 上一页 1 2 3 10 下一页 ›