Triangle-free subgraphs of random graphs

DOI10.1016/j.endm.2015.06.055zbMath1346.05262arXiv1507.05226OpenAlexW1467234846MaRDI QIDQ322274

Mohammad Hasan, M. Dambrine

Publication date: 14 October 2016

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

zbMATH Keywords

random graphsAndrásfai-Erdős-Sós theoremchromatic thresholdsparse regularity

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• On the KŁR conjecture in random graphs
• On \(K^ 4\)-free subgraphs of random graphs
• On the chromatic number of triangle-free graphs of large minimum degree
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On a valence problem in extremal graph theory
• Mantel's theorem for random graphs
• Szemerédi’s Regularity Lemma for Sparse Graphs

This page was built for publication: Triangle-free subgraphs of random graphs