On an anti-Ramsey threshold for random graphs
From MaRDI portal
Publication:402453
DOI10.1016/J.EJC.2014.02.004zbMATH Open1297.05220OpenAlexW2064298921WikidataQ101496290 ScholiaQ101496290MaRDI QIDQ402453FDOQ402453
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
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07) Generalized Ramsey theory (05C55)
Cites Work
- Title not available (Why is that?)
- The phase transition in inhomogeneous random graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Random graphs.
- Quasi‐random graphs with given degree sequences
- Combinatorial theorems in sparse random sets
- Hypergraph containers
- Independent sets in hypergraphs
- Extremal results in random graphs
- Rainbow generalizations of Ramsey theory: A survey
- A Combinatorial Theorem
- Threshold functions
- On \(K^ 4\)-free subgraphs of random graphs
- Rainbow Turán Problems
- Title not available (Why is that?)
- Szemerédi’s Regularity Lemma for Sparse Graphs
- On the KŁR conjecture in random graphs
- Threshold Functions for Ramsey Properties
- Concentration of multivariate polynomials and its applications
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Ramsey properties of random discrete structures
- Title not available (Why is that?)
- The Turn Theorem for Random Graphs
- Spectral techniques applied to sparse random graphs
- Properly coloured copies and rainbow copies of large graphs with small maximum degree
- The sparse regularity lemma and its applications
- Very large graphs
- Rainbow subgraphs in properly edge‐colored graphs
- Title not available (Why is that?)
- On an anti‐Ramsey threshold for sparse graphs with one triangle
- Constrained Ramsey numbers of graphs
- On an anti‐Ramsey property of Ramanujan graphs
- Anti-Ramsey properties of random graphs
Cited In (15)
- An algorithmic framework for obtaining lower bounds for random Ramsey problems
- Anti-Ramsey properties of random graphs
- On an anti-Ramsey property of random graphs
- Anti-Ramsey threshold of cycles for sparse graphs
- The threshold for combs in random graphs
- Rainbow cliques in randomly perturbed dense graphs
- Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
- Sharp thresholds for certain Ramsey properties of random graphs
- Coloring the edges of a random graph without a monochromatic giant component
- Betti numbers and anti-lecture Hall compositions of random threshold graphs
- The anti-Ramsey threshold of complete graphs
- Small rainbow cliques in randomly perturbed dense graphs
- Large Rainbow Cliques in Randomly Perturbed Dense Graphs
- Upper bounds on probability thresholds for asymmetric Ramsey properties
- 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)
