Ramsey properties of random hypergraphs
Let \(K^{(k)} (n,p)\) denote the random \(k\)-uniform hypergraph obtained by the independent inclusion of each of the \({n\choose k}\) \(k\)-subsets with probability \(p\). If \(F\) and \(G\) are two \(k\)-uniform hypergraphs, the Ramsey theory arrow notation, \(F\to(G)^e_r\), stands for the statement: For every partition of the edges of \(F\) into \(r\) classes, at least one of the classes contains a copy of \(G\). The main result of this paper is Theorem 1.4: There exists an absolute constant \(C>0\) such that \(\lim_{n\to\infty} P(K^{(3)} (n,p)\to (K_4^{(3)})_2^{e}) =1\) for \(p>Cn^{-{1 \over 3}}\).
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
- scientific article; zbMATH DE number 4212111 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 1256685 (Why is no real title available?)
- scientific article; zbMATH DE number 524135 (Why is no real title available?)
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- Poisson approximation for large deviations
- Ramsey properties of random graphs
- Random graphs with monochromatic triangles in every edge coloring
- Some remarks on the theory of graphs
- Threshold Functions for Ramsey Properties
- An algorithmic framework for obtaining lower bounds for random Ramsey problems
- An asymmetric random Rado theorem: 1-statement
- A hierarchy of randomness for graphs
- A randomized version of Ramsey's theorem
- Upper bounds on probability thresholds for asymmetric Ramsey properties
- Ramsey properties of random discrete structures
- A randomized version of Ramsey's theorem
- Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs
- Combinatorial theorems in sparse random sets
- Regular pairs in sparse random graphs I
- Sharp thresholds for certain Ramsey properties of random graphs
- Symmetric and asymmetric Ramsey properties in random hypergraphs
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- Counting subgraphs in quasi‐random 4‐uniform hypergraphs
- On characterizing hypergraph regularity
- An exponential-type upper bound for Folkman numbers
- Ramsey properties of randomly perturbed hypergraphs
- Sprinkling with random regular graphs
- On the stability of the Erdős-Ko-Rado theorem
- Ramsey properties of random graphs
- Note on the 3-graph counting Lemma
This page was built for publication: Ramsey properties of random hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380335)
