5,237 research outputs found
On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids
The heterochromatic number hc(H) of a non-empty hypergraph H is the smallest
integer k such that for every colouring of the vertices of H with exactly k
colours, there is a hyperedge of H all of whose vertices have different
colours. We denote by nu(H) the number of vertices of H and by tau(H) the size
of the smallest set containing at least two vertices of each hyperedge of H.
For a complete geometric graph G with n > 2 vertices let H = H(G) be the
hypergraph whose vertices are the edges of G and whose hyperedges are the edge
sets of plane spanning trees of G. We prove that if G has at most one interior
vertex, then hc(H) = nu(H) - tau(H) + 2. We also show that hc(H) = nu(H) -
tau(H) + 2 whenever H is a hypergraph with vertex set and hyperedge set given
by the ground set and the bases of a matroid, respectively
Semi-algebraic Ramsey numbers
Given a finite point set , a -ary semi-algebraic
relation on is the set of -tuples of points in , which is
determined by a finite number of polynomial equations and inequalities in
real variables. The description complexity of such a relation is at most if
the number of polynomials and their degrees are all bounded by . The Ramsey
number is the minimum such that any -element point set
in equipped with a -ary semi-algebraic relation , such
that has complexity at most , contains members such that every
-tuple induced by them is in , or members such that every -tuple
induced by them is not in .
We give a new upper bound for for and fixed.
In particular, we show that for fixed integers , establishing a subexponential upper bound on .
This improves the previous bound of due to Conlon, Fox, Pach,
Sudakov, and Suk, where is a very large constant depending on and
. As an application, we give new estimates for a recently studied
Ramsey-type problem on hyperplane arrangements in . We also study
multi-color Ramsey numbers for triangles in our semi-algebraic setting,
achieving some partial results
Positional Games
Positional games are a branch of combinatorics, researching a variety of
two-player games, ranging from popular recreational games such as Tic-Tac-Toe
and Hex, to purely abstract games played on graphs and hypergraphs. It is
closely connected to many other combinatorial disciplines such as Ramsey
theory, extremal graph and set theory, probabilistic combinatorics, and to
computer science. We survey the basic notions of the field, its approaches and
tools, as well as numerous recent advances, standing open problems and
promising research directions.Comment: Submitted to Proceedings of the ICM 201
The history of degenerate (bipartite) extremal graph problems
This paper is a survey on Extremal Graph Theory, primarily focusing on the
case when one of the excluded graphs is bipartite. On one hand we give an
introduction to this field and also describe many important results, methods,
problems, and constructions.Comment: 97 pages, 11 figures, many problems. This is the preliminary version
of our survey presented in Erdos 100. In this version 2 only a citation was
complete
On metric Ramsey-type phenomena
The main question studied in this article may be viewed as a nonlinear
analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey
theory in combinatorics. Given a finite metric space on n points, we seek its
subspace of largest cardinality which can be embedded with a given distortion
in Hilbert space. We provide nearly tight upper and lower bounds on the
cardinality of this subspace in terms of n and the desired distortion. Our main
theorem states that for any epsilon>0, every n point metric space contains a
subset of size at least n^{1-\epsilon} which is embeddable in Hilbert space
with O(\frac{\log(1/\epsilon)}{\epsilon}) distortion. The bound on the
distortion is tight up to the log(1/\epsilon) factor. We further include a
comprehensive study of various other aspects of this problem.Comment: 67 pages, published versio
- …