On vertex Ramsey graphs with forbidden subgraphs

DOI10.1016/j.disc.2023.113806zbMath1530.05122arXiv2211.13966MaRDI QIDQ6177416

Sahar Diskin, M. E. Zhukovskii, Michael Krivelevich, Ilay Hoshen

Publication date: 17 January 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.13966

zbMATH Keywords

random graphsvertex Ramsey

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• On generalized Ramsey numbers of Erdős and Rogers
• On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
• Graphs without large triangle free subgraphs
• Ramsey families which exclude a graph
• A note on generalized chromatic number and generalized girth
• The Ramsey Property for Families of Graphs Which Exclude a Given Graph
• Bounding Ramsey numbers through large deviation inequalities
• The Construction of Certain Graphs
• Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors

This page was built for publication: On vertex Ramsey graphs with forbidden subgraphs