Random graphs with monochromatic triangles in every edge coloring

DOI10.1002/RSA.3240050202zbMATH Open0790.05079OpenAlexW1971734630MaRDI QIDQ4286293FDOQ4286293

Authors: 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

Recommendations

• A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
• Monochromatic cycle partitions in random graphs
• Almost all graphs with 2. 522\(n\) edges are not 3-colorable
• Monochromatic cycle covers in random graphs
• Covering 3-edge-colored random graphs with monochromatic trees

zbMATH Keywords

random graphmonochromatic triangle\(r\)-coloring

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Poisson approximation for large deviations
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• The Algorithmic Aspects of the Regularity Lemma
• A functional limit theorem for random graphs with applications to subgraph count statistics

Cited In (41)

• An algorithmic framework for obtaining lower bounds for random Ramsey problems
• Upper tails for subgraph counts in random graphs
• A hierarchy of randomness for graphs
• Monochromatic trees in random graphs
• Combinatorial theorems in sparse random sets
• A randomized version of Ramsey's theorem
• Existence thresholds and Ramsey properties of random posets
• Triangles in random graphs
• A short proof of the random Ramsey theorem
• Ramsey properties of random discrete structures
• Monochromatic subgraphs in iterated triangulations
• A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
• Towards the 0-statement of the Kohayakawa-Kreuter conjecture
• Rainbow cliques in randomly perturbed dense graphs
• Chromatic number is Ramsey distinguishing
• Regular pairs in sparse random graphs I
• On characterizing hypergraph regularity
• Independent sets in hypergraphs and Ramsey properties of graphs and the integers
• On the missing log in upper tail estimates
• Sharp thresholds for certain Ramsey properties of random graphs
• Covering 3-edge-colored random graphs with monochromatic trees
• Maximum number of symmetric extensions in random graphs
• The infamous upper tail
• A counterexample to the DeMarco-Kahn upper tail conjecture
• Coloring the edges of a random graph without a monochromatic giant component
• Blowup Ramsey numbers
• Upper tails for arithmetic progressions in random subsets
• Small rainbow cliques in randomly perturbed dense graphs
• All Triangles are Ramsey
• Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties
• On the threshold for the maker-breaker \(H\)-game
• Large Rainbow Cliques in Randomly Perturbed Dense Graphs
• Random Van der Waerden theorem
• \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
• An asymmetric random Rado theorem: 1-statement
• Ramsey properties of random hypergraphs
• Turán's extremal problem in random graphs: Forbidding odd cycles
• Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers
• Ramsey properties of randomly perturbed graphs: cliques and cycles
• Symmetric and asymmetric Ramsey properties in random hypergraphs
• The Maker-Breaker Rado game on a random set of integers

This page was built for publication: Random graphs with monochromatic triangles in every edge coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286293)