On an anti-Ramsey threshold for random graphs
From MaRDI portal
Publication:402453
DOI10.1016/J.EJC.2014.02.004zbMath1297.05220OpenAlexW2064298921WikidataQ101496290 ScholiaQ101496290MaRDI QIDQ402453
P. B. Konstadinidis, Yoshiharu Kohayakawa, Guilherme Oliveira 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
Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Vertex degrees (05C07)
Related Items (6)
Anti-Ramsey threshold of cycles for sparse 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 ⋮ Small rainbow cliques in randomly perturbed dense graphs ⋮ Anti-Ramsey threshold of cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial theorems in sparse random sets
- On the KŁR conjecture in random graphs
- Hypergraph containers
- Rainbow generalizations of Ramsey theory: A survey
- Anti-Ramsey properties of random graphs
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Threshold functions
- On \(K^ 4\)-free subgraphs of random graphs
- Properly coloured copies and rainbow copies of large graphs with small maximum degree
- Ramsey properties of random discrete structures
- Rainbow Turán Problems
- Very large graphs
- Rainbow subgraphs in properly edge‐colored graphs
- Szemerédi’s Regularity Lemma for Sparse Graphs
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- On an anti‐Ramsey threshold for sparse graphs with one triangle
- Constrained Ramsey numbers of graphs
- The Turn Theorem for Random Graphs
- On an anti‐Ramsey property of Ramanujan graphs
- Threshold Functions for Ramsey Properties
- Independent sets in hypergraphs
- The phase transition in inhomogeneous random graphs
- Spectral techniques applied to sparse random graphs
- Extremal Results in Random Graphs
- Quasi‐random graphs with given degree sequences
- A Combinatorial Theorem
- Concentration of multivariate polynomials and its applications
This page was built for publication: On an anti-Ramsey threshold for random graphs
