104 research outputs found
Multicolour Ramsey numbers of paths and even cycles
We prove new upper bounds on the multicolour Ramsey numbers of paths and even cycles
Some hard families of parameterised counting problems
We consider parameterised subgraph-counting problems of the following form:
given a graph G, how many k-tuples of its vertices have a given property? A
number of such problems are known to be #W[1]-complete; here we substantially
generalise some of these existing results by proving hardness for two large
families of such problems. We demonstrate that it is #W[1]-hard to count the
number of k-vertex subgraphs having any property where the number of distinct
edge-densities of labelled subgraphs that satisfy the property is o(k^2). In
the special case that the property in question depends only on the number of
edges in the subgraph, we give a strengthening of this result which leads to
our second family of hard problems.Comment: A few more minor changes. This version to appear in the ACM
Transactions on Computation Theor
Improved bounds on the multicolor Ramsey numbers of paths and even cycles
We study the multicolor Ramsey numbers for paths and even cycles,
and , which are the smallest integers such that every coloring of
the complete graph has a monochromatic copy of or
respectively. For a long time, has only been known to lie between
and . A recent breakthrough by S\'ark\"ozy and later
improvement by Davies, Jenssen and Roberts give an upper bound of . We improve the upper bound to . Our approach uses structural insights in connected graphs without a
large matching. These insights may be of independent interest
Monochromatic loose paths in multicolored -uniform cliques
For integers and , a -uniform hypergraph is called a
loose path of length , and denoted by , if it consists of
edges such that if and
if . In other words, each pair of
consecutive edges intersects on a single vertex, while all other pairs are
disjoint. Let be the minimum integer such that every
-edge-coloring of the complete -uniform hypergraph yields a
monochromatic copy of . In this paper we are mostly interested in
constructive upper bounds on , meaning that on the cost of
possibly enlarging the order of the complete hypergraph, we would like to
efficiently find a monochromatic copy of in every coloring. In
particular, we show that there is a constant such that for all ,
, , and , there is an
algorithm such that for every -edge-coloring of the edges of , it
finds a monochromatic copy of in time at most . We also
prove a non-constructive upper bound
An improvement on Łuczak's connected matchings method
A connected matching in a graph G is a matching contained in a connected component of G. A well-known method due to Łuczak reduces problems about monochromatic paths and cycles in complete graphs to problems about monochromatic connected matchings in almost complete graphs. We show that these can be further reduced to problems about monochromatic connected matchings in complete graphs. We illustrate the potential of this new reduction by showing how it can be used to determine the 3-colour Ramsey number of long paths, using a simpler argument than the original one by Gyárfás, Ruszinkó, Sárközy, and Szemerédi (2007)
- …