On an anti-Ramsey threshold for random graphs

DOI10.1016/J.EJC.2014.02.004MaRDI QIDQ402453zbMATHOpenAlexWikidataFDO

Authors P. B. Konstadinidis, Yoshiharu Kohayakawa, G. O. Mota

Publication date 28 August 2014

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2014.02.004

zbMATH Keywords

degree sequencequasi-random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07) Generalized Ramsey theory (05C55)

Recommendations

• On an anti-Ramsey property of random graphs
• On an anti-Ramsey threshold for sparse graphs with one triangle
• Anti-Ramsey properties of random graphs
• The anti-Ramsey threshold of complete graphs
• Anti-Ramsey threshold of cycles

Cites work

• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 3668662 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 524135 (Why is no real title available?)
• scientific article; zbMATH DE number 1944144 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• A Combinatorial Theorem
• Anti-Ramsey properties of random graphs
• Combinatorial theorems in sparse random sets
• Concentration of multivariate polynomials and its applications
• Constrained Ramsey numbers of graphs
• Extremal results in random graphs
• Hypergraph containers
• Independent sets in hypergraphs
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• On \(K^ 4\)-free subgraphs of random graphs
• On an anti-Ramsey threshold for sparse graphs with one triangle
• On an anti‐Ramsey property of Ramanujan graphs
• On the KŁR conjecture in random graphs
• Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
• Properly coloured copies and rainbow copies of large graphs with small maximum degree
• Quasi‐random graphs with given degree sequences
• Rainbow Turán Problems
• Rainbow generalizations of Ramsey theory: A survey
• Rainbow subgraphs in properly edge‐colored graphs
• Ramsey properties of random discrete structures
• Random graphs.
• Spectral techniques applied to sparse random graphs
• Szemerédi’s Regularity Lemma for Sparse Graphs
• The Turn Theorem for Random Graphs
• The phase transition in inhomogeneous random graphs
• The sparse regularity lemma and its applications
• Threshold Functions for Ramsey Properties
• Threshold functions
• Very large graphs

Cited in

(17)

• The threshold for combs in random graphs
• Coloring the edges of a random graph without a monochromatic giant component
• Upper bounds on probability thresholds for asymmetric Ramsey properties
• Sharp thresholds for certain Ramsey properties of random graphs
• Large Rainbow Cliques in Randomly Perturbed Dense Graphs
• The anti-Ramsey threshold of complete graphs
• An algorithmic framework for obtaining lower bounds for random Ramsey problems
• On an anti-Ramsey threshold for sparse graphs with one triangle
• Rainbow cliques in randomly perturbed dense graphs
• Anti-Ramsey properties of random graphs
• Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
• Betti numbers and anti-lecture Hall compositions of random threshold graphs
• On an anti-Ramsey property of random graphs
• Anti-Ramsey threshold of cycles for sparse graphs
• Small rainbow cliques in randomly perturbed dense graphs
• On the anti-Ramsey threshold for non-balanced graphs
• Anti-Ramsey threshold of cycles

This page was built for publication: On an anti-Ramsey threshold for random graphs

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