19 research outputs found
Problems and memories
I state some open problems coming from joint work with Paul Erd\H{o}sComment: This is a paper form of the talk I gave on July 5, 2013 at the
centennial conference in Budapest to honor Paul Erd\H{o}
Coloring triple systems with local conditions
We produce an edge-coloring of the complete 3-uniform hypergraph on n
vertices with colors such that the edges spanned by
every set of five vertices receive at least three distinct colors. This answers
the first open case of a question of Conlon-Fox-Lee-Sudakov [1] who asked
whether such a coloring exists with colors
Semi-algebraic colorings of complete graphs
We consider -colorings of the edges of a complete graph, where each color
class is defined semi-algebraically with bounded complexity. The case
was first studied by Alon et al., who applied this framework to obtain
surprisingly strong Ramsey-type results for intersection graphs of geometric
objects and for other graphs arising in computational geometry. Considering
larger values of is relevant, e.g., to problems concerning the number of
distinct distances determined by a point set.
For and , the classical Ramsey number is the
smallest positive integer such that any -coloring of the edges of ,
the complete graph on vertices, contains a monochromatic . It is a
longstanding open problem that goes back to Schur (1916) to decide whether
, for a fixed . We prove that this is true if each color
class is defined semi-algebraically with bounded complexity. The order of
magnitude of this bound is tight. Our proof is based on the Cutting Lemma of
Chazelle {\em et al.}, and on a Szemer\'edi-type regularity lemma for
multicolored semi-algebraic graphs, which is of independent interest. The same
technique is used to address the semi-algebraic variant of a more general
Ramsey-type problem of Erd\H{o}s and Shelah
On generalized Ramsey numbers in the non-integral regime
A -coloring of a graph is an edge-coloring of such that every
-clique receives at least colors. In 1975, Erd\H{o}s and Shelah
introduced the generalized Ramsey number which is the minimum number
of colors needed in a -coloring of . In 1997, Erd\H{o}s and
Gy\'arf\'as showed that is at most a constant times
. Very recently the first author, Dudek,
and English improved this bound by a factor of for all , and they ask if this
improvement could hold for a wider range of .
We answer this in the affirmative for the entire non-integral regime, that
is, for all integers with not divisible by .
Furthermore, we provide a simultaneous three-way generalization as follows:
where -clique is replaced by any fixed graph (with not
divisible by ); to list coloring; and to -uniform
hypergraphs. Our results are a new application of the Forbidden Submatching
Method of the second and fourth authors.Comment: 9 pages; new version extends results from sublinear regime to entire
non-integral regime; new co-author adde
On locally rainbow colourings
Given a graph , let denote the smallest for which the
following holds. We can assign a -colouring of the edge set of
to each vertex in with the property that for any copy of in
, there is some such that every edge in has a different
colour in .
The study of this function was initiated by Alon and Ben-Eliezer. They
characterized the family of graphs for which is bounded and asked
whether it is true that for every other graph is polynomial. We show
that this is not the case and characterize the family of connected graphs
for which grows polynomially. Answering another question of theirs, we
also prove that for every , there is some
such that for all sufficiently large .
Finally, we show that the above problem is connected to the
Erd\H{o}s-Gy\'arf\'as function in Ramsey Theory, and prove a family of special
cases of a conjecture of Conlon, Fox, Lee and Sudakov by showing that for each
fixed the complete -uniform hypergraph can be edge-coloured
using a subpolynomial number of colours in such a way that at least colours
appear among any vertices.Comment: 12 page
Edge-coloring a graph so that every copy of a graph has an odd color class
Recently, Alon introduced the notion of an -code for a graph : a
collection of graphs on vertex set is an -code if it contains no two
members whose symmetric difference is isomorphic to . Let denote
the maximum possible cardinality of an -code, and let
. Alon observed that a lower bound on
can be obtained by attaining an upper bound on the number of colors
needed to edge-color so that every copy of has an odd color class.
Motivated by this observation, we define to be the minimum number of
colors needed to edge-color a graph so that every copy of has an odd
color class. We prove and for all odd integers . The first result shows
and was obtained independently in
arXiv:2306.14682
A new variant of the Erd\H{o}s-Gy\'{a}rf\'{a}s problem on
Motivated by an extremal problem on graph-codes that links coding theory and
graph theory, Alon recently proposed a question aiming to find the smallest
number such that there is an edge coloring of by colors with no
copy of given graph in which every color appears an even number of times.
When , the question of whether colors are enough, was
initially emphasized by Alon. Through modifications to the coloring functions
originally designed by Mubayi, and Conlon, Fox, Lee and Sudakov, the question
of has already been addressed. Expanding on this line of inquiry, we
further study this new variant of the generalized Ramsey problem and provide a
conclusively affirmative answer to Alon's question concerning .Comment: Note added: Heath and Zerbib also proved the result on
independently. arXiv:2307.0131