Asymmetric Ramsey properties of random graphs involving cliques and cycles
From MaRDI portal
Publication:6076220
DOI10.1002/rsa.21106zbMath1525.05127OpenAlexW2982633147MaRDI QIDQ6076220
Letícia Mattos, Jozef Skokan, Walner Mendonça, Anita Liebenau
Publication date: 23 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://refubium.fu-berlin.de/handle/fub188/36142
Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypergraph containers
- Ramsey properties of random graphs
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- Upper bounds on probability thresholds for asymmetric Ramsey properties
- Asymmetric Ramsey properties of random graphs involving cliques
- Sharp thresholds for certain Ramsey properties of random graphs
- SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS
- Threshold Functions for Ramsey Properties
- Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties
- Independent sets in hypergraphs
This page was built for publication: Asymmetric Ramsey properties of random graphs involving cliques and cycles