Live briefing
Everything about Homomorphism density
Fraction of graph maps that are homomorphisms
In the mathematical field of extremal graph theory, homomorphism density with respect to a graph is a parameter that is associated to each graph in the following manner:. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Homomorphism densityA 5-minute orientation
- Skim a recent paper: Threshold graphs maximise homomorphism densitiesInfluential work since 2022
- Pick up a classic book: Medical image analysisThe most-reprinted book on the subject
- Read the landmark paper: Density and power graphs in graph homomorphism problemCited 3 times
- Go sideways: Sidorenko's conjectureA closely related topic
- Go sideways: GraphonA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
🆕 Influential since 2022
đź“š Books worth reading
Medical image analysisAtam P. Dhawan · 2010
Digital Signal Processing · 2006
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Sidorenko's conjecture Sidorenko's conjecture is a major conjecture in the field of extremal graph theory, posed by Alexander Sidorenko in 1986. Roughly speaking, the conjecture…
- Graphon In graph theory and statistics, a graphon (also known as a graph limit) is a symmetric measurable function W : [ 0 , 1 ] 2 → [ 0 , 1 ] {\displaystyle W:[0…
- Forbidden subgraph problem In extremal graph theory, the forbidden subgraph problem is the following problem: given a graph G {\displaystyle G} , find the maximal number of edges…
- Flag algebra Flag algebras are an important computational tool in the field of graph theory which have a wide range of applications in homomorphism density and related…
- Common graph In graph theory, an area of mathematics, common graphs belong to a branch of extremal graph theory concerning inequalities in homomorphism densities. Roughly…
- Erdős–Stone theorem In extremal graph theory, the Erdős–Stone theorem is an asymptotic result generalising Turán's theorem to bound the number of edges in an H-free graph…
- Pseudorandom graph In graph theory, a graph is said to be a pseudorandom graph if it obeys certain properties that random graphs obey with high probability. There is no concrete…
- Extremal graph theory Extremal graph theory is a branch of combinatorics, itself an area of mathematics, that lies at the intersection of extremal combinatorics and graph theory…