Abstract
A celebrated result of Rödl and Ruciński states that for every graph $F$, which is not a forest of stars and paths of length 3, and fixed number of colours $r\geqslant 2$ there exist positive constants $c,C$ such that for $p\leqslant cn^{-1/m_{2}(F)}$ the probability that every colouring of the edges of the random graph $G(n,p)$ contains a monochromatic copy of $F$ is $o(1)$ (the ‘0-statement’), while for $p\geqslant Cn^{-1/m_{2}(F)}$ it is $1-o(1)$ (the ‘1-statement’). Here $m_{2}(F)$ denotes the 2-density of $F$. On the other hand, the case where $F$ is a forest of stars has a coarse threshold which is determined by the appearance of a certain small subgraph in $G(n,p)$. Recently, the natural extension of the 1-statement of this theorem to $k$-uniform hypergraphs was proved by Conlon and Gowers and, independently, by Friedgut, Rödl and Schacht. In particular, they showed an upper bound of order $n^{-1/m_{k}(F)}$ for the 1-statement, where $m_{k}(F)$ denotes the $k$-density of $F$. Similarly as in the graph case, it is known that the threshold for star-like hypergraphs is given by the appearance of small subgraphs. In this paper we show that another type of threshold exists if $k\geqslant 4$: there are $k$-uniform hypergraphs for which the threshold is determined by the asymmetric Ramsey problem in which a different hypergraph has to be avoided in each colour class. Along the way we obtain a general bound on the 1-statement for asymmetric Ramsey properties in random hypergraphs. This extends the work of Kohayakawa and Kreuter, and of Kohayakawa, Schacht and Spöhel who showed a similar result in the graph case. We prove the corresponding 0-statement for hypergraphs satisfying certain balancedness conditions.
Highlights
Given graphs G and F, we denote byG → (F)r the property that every colouring of the edges of G with r colours contains a monochromatic copy of F
Rodl and Rucinski [23] conjectured that the same intuition should hold as for Ramsey properties in the graph case, namely that a monochromatic copy of F appears in every colouring whenever the expected number of copies of F per hyperedge exceeds a large constant
Contrary to the graph case we show that there exist hypergraphs for which the threshold is neither the conjectured n−1/mk(F) nor is it determined by the appearance of a small subgraph
Summary
G → (F)r the property that every colouring of the edges of G with r colours contains a monochromatic copy of F. Rodl and Rucinski [23] conjectured that the same intuition should hold as for Ramsey properties in the graph case, namely that a monochromatic copy of F appears in every colouring whenever the expected number of copies of F per hyperedge exceeds a large constant They proved this for the complete 3-uniform hypergraph on 4 vertices and 2 colours and, together with Schacht, extended it in [24] to k-partite k-uniform hypergraphs. In the context of random graphs, the asymmetric Ramsey property was first studied by Kohayakawa and Kreuter [13] where they determined the threshold for the case where each Fi is a cycle The theorem shows that the function mk(·, ·) determines the threshold for the asymmetric Ramsey property for all k-uniform hypergraphs which satisfy certain conditions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.