Triangle-free subgraphs of random graphs (Q322274)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Triangle-free subgraphs of random graphs	scientific article

Statements

scholarly article

0 references

Triangle-free subgraphs of random graphs (English)

0 references

0 references

0 references

publication date

14 October 2016

0 references

full work available at URL

https://arxiv.org/abs/1507.05226

0 references

http://eprints.lse.ac.uk/64640/1/__lse.ac.uk_storage_LIBRARY_Secondary_libfile_shared_repository_Content_Allen%2C%20Peter_Triangle-free%20subgraphs_Allen_Triangle-free%20subgraphs_2015.pdf

0 references

zbMATH Keywords

random graphs

0 references

sparse regularity

0 references

Andrásfai-Erdős-Sós theorem

0 references

chromatic threshold

0 references

MaRDI profile type

MaRDI publication profile

0 references

On the connection between chromatic number, maximal clique and minimal degree of a graph

0 references

On the KŁR conjecture in random graphs

0 references

Mantel's theorem for random graphs

0 references

On a valence problem in extremal graph theory

0 references

Szemerédi’s Regularity Lemma for Sparse Graphs

0 references

On \(K^ 4\)-free subgraphs of random graphs

0 references

On the chromatic number of triangle-free graphs of large minimum degree

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1016/J.ENDM.2015.06.055

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:322274

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q322274&oldid=38305215"