43 research outputs found
The Erd\H{o}s-Rothschild problem on edge-colourings with forbidden monochromatic cliques
Let be a sequence of natural numbers. For a
graph , let denote the number of colourings of the edges
of with colours such that, for every , the
edges of colour contain no clique of order . Write
to denote the maximum of over all graphs on vertices.
This problem was first considered by Erd\H{o}s and Rothschild in 1974, but it
has been solved only for a very small number of non-trivial cases.
We prove that, for every and , there is a complete
multipartite graph on vertices with . Also, for every we construct a finite
optimisation problem whose maximum is equal to the limit of as tends to infinity. Our final result is a
stability theorem for complete multipartite graphs , describing the
asymptotic structure of such with in terms of solutions to the optimisation problem.Comment: 16 pages, to appear in Math. Proc. Cambridge Phil. So
Properly coloured copies and rainbow copies of large graphs with small maximum degree
Let G be a graph on n vertices with maximum degree D. We use the Lov\'asz
local lemma to show the following two results about colourings c of the edges
of the complete graph K_n. If for each vertex v of K_n the colouring c assigns
each colour to at most (n-2)/22.4D^2 edges emanating from v, then there is a
copy of G in K_n which is properly edge-coloured by c. This improves on a
result of Alon, Jiang, Miller, and Pritikin [Random Struct. Algorithms 23(4),
409-433, 2003]. On the other hand, if c assigns each colour to at most n/51D^2
edges of K_n, then there is a copy of G in K_n such that each edge of G
receives a different colour from c. This proves a conjecture of Frieze and
Krivelevich [Electron. J. Comb. 15(1), R59, 2008]. Our proofs rely on a
framework developed by Lu and Sz\'ekely [Electron. J. Comb. 14(1), R63, 2007]
for applying the local lemma to random injections. In order to improve the
constants in our results we use a version of the local lemma due to Bissacot,
Fern\'andez, Procacci, and Scoppola [preprint, arXiv:0910.1824].Comment: 9 page
Hamiltonicity and -hypergraphs
We define and study a special type of hypergraph. A -hypergraph ), where is a partition of , is an
-uniform hypergraph having vertices partitioned into classes of
vertices each. If the classes are denoted by , ,...,, then a
subset of of size is an edge if the partition of formed by
the non-zero cardinalities , ,
is . The non-empty intersections are called the parts
of , and denotes the number of parts. We consider various types
of cycles in hypergraphs such as Berge cycles and sharp cycles in which only
consecutive edges have a nonempty intersection. We show that most
-hypergraphs contain a Hamiltonian Berge cycle and that, for and , a -hypergraph always contains a sharp
Hamiltonian cycle. We also extend this result to -intersecting cycles