The anti-Ramsey threshold of complete graphs
From MaRDI portal
Publication:2689511
DOI10.1016/J.DISC.2023.113343OpenAlexW2912404715MaRDI QIDQ2689511
Olaf Parczyk, Yoshiharu Kohayakawa, Jakob Schnitzer, Guilherme Oliveira Mota
Publication date: 10 March 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.00306
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On an anti-Ramsey threshold for random graphs
- Threshold functions
- An algorithmic framework for obtaining lower bounds for random Ramsey problems
- Anti-Ramsey threshold of cycles
- Threshold functions for small subgraphs
- Rainbow subgraphs in properly edge‐colored graphs
- Combinatorial theorems relative to a random set
- On an anti‐Ramsey threshold for sparse graphs with one triangle
- Threshold Functions for Ramsey Properties
This page was built for publication: The anti-Ramsey threshold of complete graphs