Random graphs with monochromatic triangles in every edge coloring

DOI10.1002/rsa.3240050202zbMath0790.05079OpenAlexW1971734630MaRDI QIDQ4286293

Vojtěch Rödl, Andrzej Ruciński

Publication date: 8 May 1994

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240050202

zbMATH Keywords

random graphmonochromatic triangle\(r\)-coloring

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items

Towards the 0-statement of the Kohayakawa-Kreuter conjecture, Upper tails for subgraph counts in random graphs, On characterizing hypergraph regularity, The infamous upper tail, Large Rainbow Cliques in Randomly Perturbed Dense Graphs, Combinatorial theorems in sparse random sets, Turán's extremal problem in random graphs: Forbidding odd cycles, Ramsey properties of random hypergraphs, Upper tails for arithmetic progressions in random subsets, Chromatic number is Ramsey distinguishing, \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs, SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS, A Short Proof of the Random Ramsey Theorem, Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers, Blowup Ramsey numbers, The Maker--Breaker Rado Game on a Random Set of Integers, An algorithmic framework for obtaining lower bounds for random Ramsey problems, Sharp thresholds for certain Ramsey properties of random graphs, Regular pairs in sparse random graphs I, Ramsey properties of random discrete structures, On the missing log in upper tail estimates, A counterexample to the DeMarco‐Kahn upper tail conjecture, Existence thresholds and Ramsey properties of random posets, Small rainbow cliques in randomly perturbed dense graphs, On the threshold for the Maker-BreakerH-game, Random Van der Waerden theorem, Ramsey properties of randomly perturbed graphs: cliques and cycles, Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties, Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers, An asymmetric random Rado theorem: 1-statement, A hierarchy of randomness for graphs, A randomized version of Ramsey's theorem

Cites Work

• Unnamed Item
• A functional limit theorem for random graphs with applications to subgraph count statistics
• Poisson approximation for large deviations
• The Algorithmic Aspects of the Regularity Lemma
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring